Will a prompt that enables a prompt that enables GPT-4 to solve easy Sudoku puzzles be found ?
I don't know how much meta-prompting have been explored. Maybe it's where The Singularity is at ?
Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
41–50 of 68 posts
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#42Unlikely, for reasons explained in this video: https://youtu.be/bEovhfxJsM4?t=2339 However, apparently it can write a program using the Z3 SAT solver to find a solution.
It seems like it might be possible to get around this by letting the model emit moves like ` discard last 5` which would also let it keep a history of it's previous branches.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#43The title is funny to me. We should consider a new computation complexity class for LLMs. Let's call the ones that can be solved with a prompt, Promptable. For the problems that we cannot reliably solve with a single prompt yet, let's call them non-deterministic promptable, or NP. Question is, for most of these hard problems, is there a prompt that can solve them? Better yet, is there a prompt good enough that we col…
I honestly can't tell if any of the other replies to this comment got the joke.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#44Unlikely, for reasons explained in this video: https://youtu.be/bEovhfxJsM4?t=2339 However, it apparently can write a program using the Z3 SAT solver to find a solution.
> However, it apparently can write a program using the Z3 SAT solver to find a solution.
Not that it's unimpressive in general that a LLM can write a program from a prompt like that, but for this particular juxtaposition it doesn't seem like it's especially interesting or impressive that it can write such a program. A SAT program is basically just re-stating the the rules in a particular form. It doesn't even have to be able to apply those rules. The solver does the hard work.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#45The title is funny to me. We should consider a new computation complexity class for LLMs. Let's call the ones that can be solved with a prompt, Promptable. For the problems that we cannot reliably solve with a single prompt yet, let's call them non-deterministic promptable, or NP. Question is, for most of these hard problems, is there a prompt that can solve them? Better yet, is there a prompt good enough that we col…
> The title is funny to me. We should consider a new computation complexity class for LLMs. Let's call the ones that can be solved with a prompt, Promptable. For the problems that we cannot reliably solve with a single prompt yet, let's call them non-deterministic promptable, or NP.
Promptable is old hat now. I propose an entirely new class of problems which is whether you can prompt GPT to construct a prompt for GPT that can solve a problem. I call it Deep-Promptability™ (patent pending). The "order" is defined by how many levels of prompting can you solve the problem in, so if a problem is order-3 deep-promptable then you can prompt GPT to construct a prompt for GPT that will construct a prompt that allows GPT to solve it.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#46For most sudoku puzzles solving each cell is a logic puzzle that can be expressed in words just as current solvers have it in code. It can try to solve each vacant cell in turn using each of its rules until it finds a solution for that cell. And then it can be told to keep trying to solve another cell until it finishes the puzzle. Brute force with a core of logic.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#47The title is funny to me. We should consider a new computation complexity class for LLMs. Let's call the ones that can be solved with a prompt, Promptable. For the problems that we cannot reliably solve with a single prompt yet, let's call them non-deterministic promptable, or NP. Question is, for most of these hard problems, is there a prompt that can solve them? Better yet, is there a prompt good enough that we col…
From what I can tell, experts currently project the problem "TURN HUMANS TO PAPERCLIPS" is in complexity class "Promptable," but that the Boolean Satisfiability problem is not in "Promptable."
[deleted]
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#48Earlier quoted context omitted.
Are large language models even Turing complete? Or more specifically, is there something we can say about LLMs as a class with respect to this question? For any architecture like Vaswani’s GPT or a bigger iteration of it, eventually you run out of attention heads and layers. If the answer is categorically no, then any sufficiently sophisticated code is not “promotable”. However, I don’t think there’s anything in prin…
> Are large language models even Turing complete? Idealized deterministic computing systems are the only thing that can be Turing complete, actual systems cannot be (because Turing completeness requires infinite space), LLMs are actual systems, and also are not limited-space approximation of idealized deterministic systems (they are, I suppose, deterministic if you know all the relevant parameters, including potentia…
> Idealized deterministic computing systems are the only thing that can be Turing complete
That’s not true. My computer is for all practical purposes Turing complete - it’s tape is not the RAM, but due to side effecting, being connected to the internet, the whole universe. So while the universe itself is finite, nothing material can be mathematically infinite, Turing completeness fails “lazily”. Unless you hit the limits, it is as good as infinite.
As for the current topic, prompting problems are after a while just memoization to some limit with some strange encoding.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#49Earlier quoted context omitted.
It's not realistically Turing complete. It assumes infinite precision.
Right but a Turing computer assumes infinite storage space which is itself impossible. You cannot have infinite precision without infinite storage, and all real computers that we colloquially say are Turing complete have finite everything.
It lazily uses infinite tape though, so it is Turing complete for an actual, finite number of steps. You can’t have infinite precision even for a single step.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#50Unlikely, for reasons explained in this video: https://youtu.be/bEovhfxJsM4?t=2339 However, it apparently can write a program using the Z3 SAT solver to find a solution.
> However, it apparently can write a program using the Z3 SAT solver to find a solution. Not that it's unimpressive in general that a LLM can write a program from a prompt like that, but for this particular juxtaposition it doesn't seem like it's especially interesting or impressive that it can write such a program. A SAT program is basically just re-stating the the rules in a particular form. It doesn't even have to…
Also, if it has enough training data to know how to write such a SAT solver problem, it has surely seen sudoku exercises as part of that data set..