Live briefing
Everything about List of undecidable problems
Computational problems no algorithm can solve
In computability theory, an undecidable problem is a decision problem for which an effective method (algorithm) to derive the correct answer does not exist. More formally, an undecidable problem is a problem whose language is not a recursive set; see the article Decidable language. There are uncountably many undecidable problems, so the list below is necessarily incomplete. Though undecidable languages are not recursive languages, they may be subsets of Turing recognizable languages: i.e., such undecidable languages may be recursively enumerable. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: List of undecidable problemsA 5-minute orientation
- Pick up a classic book: Writing ArgumentsThe most-reprinted book on the subject
- Read the landmark paper: Undecidable Problems for Probabilistic Automata of Fixed DimensionCited 63 times
- Go sideways: Halting problemA closely related topic
- Go sideways: EntscheidungsproblemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
📚 Books worth reading
Writing ArgumentsJohn D. Ramage, John C. Bean · 2000
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Polls & surveysNorman M. Bradburn · 1988
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Halting problem In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program…
- Entscheidungsproblem In mathematics and computer science, the Entscheidungsproblem (German for 'decision problem'; pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm]) is a challenge posed…
- Undecidable problem In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct…
- Rice's theorem In computability theory, Rice's theorem states that all non-trivial semantic properties of programs are undecidable. A semantic property is one about the…
- Turing reduction In computability theory, a Turing reduction from a decision problem A to a decision problem B is an oracle machine that decides problem A given an oracle…
- Word problem (mathematics) In computational mathematics, a word problem is the problem of deciding whether two given expressions are equivalent with respect to a set of rewriting…
- Computability Computability is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical logic…
- Computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated…