Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
1–10 of 68 posts
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#2Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#3Is there any theoretical reason why an attention based llm could or couldn't generate an answer to an NP hard problem? As I understand, attention is N^2, but it's not obvious if that's relevant to the complexity of problems that can be solved. It's obviously not relevant to answers that are regurgitated, which may be all answers?
It would be better if "easy" had a mathematical definition.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#4> Easy-rated Sudoku puzzle means a puzzle classified as easy by any reputable Sudoku site or puzzle generator. This market plans to use the LA Times(Sudoku - Free daily Sudoku games from the Los Angeles Times (latimes.com)) for judging, but I maintain the option to use a different Sudoku generator. Is there any theoretical reason why an attention based llm could or couldn't generate an answer to an NP hard problem? A…
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#5Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#6Question 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 collapse all of the hardest problems in NP with a single prompt?
Will we ever know if NP can be reduced to P???
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#7> Easy-rated Sudoku puzzle means a puzzle classified as easy by any reputable Sudoku site or puzzle generator. This market plans to use the LA Times(Sudoku - Free daily Sudoku games from the Los Angeles Times (latimes.com)) for judging, but I maintain the option to use a different Sudoku generator. Is there any theoretical reason why an attention based llm could or couldn't generate an answer to an NP hard problem? A…
Putting aside for the moment that a Large Language Model (LLM) is a predictive statistical model based on and producing from what consisted its training set, answering whether or not any algorithm can solve an NP hard problem first requires a clarification; is a brute force exhaustive search allowed?
If it is, I am unsure if an arbitrary LLM could find a solution due to the dependence on training. If not, I am confident in saying an LLM could not solve arbitrary NP hard problems in P time as that has yet to be proven possible AFAIK.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#8Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#9An LLM is a tool. It is a very versatile tool. It can be used in many situations. It does not therefore follow that it should be used in all situations. Even if you wanted to use an AI to solve sudoku, there is no particular reason to begin with a model trained for language modeling instead of a model better suited to the task.
Re: Will a prompt that enables GPT-4 to solve easy Sudoku puzzles be found?
#10An LLM is a tool. It is a very versatile tool. It can be used in many situations. It does not therefore follow that it should be used in all situations. Even if you wanted to use an AI to solve sudoku, there is no particular reason to begin with a model trained for language modeling instead of a model better suited to the task.
I don't get it there are so many ways to solve sudokus why does anyone care about this anyways?
Eg. Can a model play tic-tac-toe or solve chess puzzles