Undecidable problem
Yes-or-no question that cannot ever be solved by a computer / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Undecidable problem?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. The halting problem is an example: it can be proven that there is no algorithm that correctly determines whether an arbitrary program eventually halts when run.[1]
This article needs additional citations for verification. (July 2019) |