such undecidable languages may be recursively enumerable. Many, if not most, undecidable problems in mathematics can be posed as word problems: determining...
14 KB (1,586 words) - 06:57, 20 May 2025
computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an...
14 KB (1,921 words) - 21:06, 21 February 2025
technologies List of NP-complete problems List of paradoxes List of PSPACE-complete problems List of undecidable problems List of unsolved deaths Lists of problems...
2 KB (120 words) - 13:13, 30 May 2025
lists of problems: List of philosophical problems List of undecidable problems Lists of unsolved problems List of NP-complete problems List of PSPACE-complete...
343 bytes (36 words) - 07:25, 7 December 2024
correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946. Because it is simpler than the halting problem and the...
25 KB (2,521 words) - 16:01, 20 December 2024
halting problem is undecidable, meaning that no general algorithm exists that solves the halting problem for all possible program–input pairs. The problem comes...
53 KB (7,356 words) - 22:58, 18 May 2025
Entscheidungsproblem (redirect from Church's undecidability theorem)
decidabilities. On the top are the undecidable problems. Below it are the decidable problems. Furthermore, the decidable problems can be divided into a complexity...
19 KB (2,642 words) - 09:57, 5 May 2025
The halting problem is an important undecidable decision problem; for more examples, see list of undecidable problems. Decision problems can be ordered...
10 KB (1,246 words) - 09:36, 19 May 2025
NP-hardness (redirect from NP-hard problems)
as difficult to solve as the problems in NP. However, the opposite direction is not true: some problems are undecidable, and therefore even more difficult...
9 KB (1,119 words) - 00:35, 28 April 2025
Product Puzzle", which is not impossible -gry, a word puzzle List of undecidable problems, no algorithm can exist to answer a yes–no question about the...
5 KB (502 words) - 00:31, 3 March 2025
Hilbert's tenth problem is the tenth on the list of mathematical problems that the German mathematician David Hilbert posed in 1900. It is the challenge...
26 KB (3,294 words) - 11:45, 5 June 2025
RE (complexity) (category Undecidable problems)
problems: The domino problem for Wang tiles. The satisfiability problem for first-order logic. Knuth–Bendix completion algorithm List of undecidable problems...
7 KB (941 words) - 14:58, 13 May 2025
Spectral gap (physics) (redirect from Spectral gap problem)
List of undecidable problems Spectral gap, in mathematics Cubitt, Toby S.; Perez-Garcia, David; Wolf, Michael M. (2015-12-10). "Undecidability of the...
5 KB (509 words) - 03:17, 17 April 2025
conductivities List of undecidable problems List of unsolved deaths List of unsolved problems in astronomy List of unsolved problems in biology List of unsolved...
12 KB (1,205 words) - 13:21, 29 November 2024
because undecidable but verifiable problems do exist, for example, Hilbert's tenth problem which is RE-complete. A similar problem exists in the theory of algebraic...
63 KB (7,784 words) - 06:53, 25 April 2025
Recursive set, a "decidable set" in recursion theory Decision problem List of undecidable problems Decision (disambiguation) Decide (disambiguation) This disambiguation...
552 bytes (95 words) - 15:04, 6 November 2022
Diophantine equations. In principle, many problems can be reduced to the halting problem. See the list of undecidable problems. Gödel's incompleteness theorems...
10 KB (1,250 words) - 12:22, 3 February 2025
Computability theory (redirect from Theory of computability)
(1965) edited by Martin Davis The list of undecidable problems gives additional examples. A list of open problems is maintained by Joseph Miller and André...
54 KB (6,414 words) - 03:45, 30 May 2025
List of statements undecidable in Z F C {\displaystyle {\mathsf {ZFC}}} Gelfand–Naimark theorem Akemann, Charles; Weaver, Nik (2004), "Consistency of...
2 KB (243 words) - 06:41, 25 January 2024
Computability (redirect from Formal models of computation)
answer the question of whether a given Oracle machine will ever halt. Automata theory Abstract machine List of undecidable problems Computational complexity...
21 KB (3,293 words) - 20:34, 1 June 2025
the first purely algebraic problem to be proved undecidable. Shelah later showed that the Whitehead problem remains undecidable even if one assumes the continuum...
6 KB (673 words) - 12:08, 30 January 2025
History of the Church–Turing thesis Lambda calculus List of undecidable problems Post correspondence problem Post's theorem Primitive recursive function Recursion...
25 KB (2,119 words) - 22:15, 10 April 2025
Algorithm (redirect from Algorithmic problem)
ISBN 978-0-85664-464-1. Davis, Martin (1965). The Undecidable: Basic Papers On Undecidable Propositions, Unsolvable Problems and Computable Functions. New York: Raven...
61 KB (7,016 words) - 17:27, 6 June 2025
well-known example of an undecidable problem. If A {\displaystyle A} is a finite set of generators for G {\displaystyle G} , then the word problem is the membership...
29 KB (4,932 words) - 01:25, 8 April 2025
Gödel's incompleteness theorems (redirect from Godel's Undecidability theorem)
decision problems, which are countably infinite sets of questions each requiring a yes or no answer. Such a problem is said to be undecidable if there...
92 KB (12,173 words) - 10:15, 18 May 2025
constructions of classical geometry, and solving the general quintic equation algebraically. Also provably unsolvable are so-called undecidable problems, such...
7 KB (936 words) - 05:31, 1 June 2025
Satisfiability modulo theories (redirect from List of SMT solvers)
NP-complete, the SMT problem is typically NP-hard, and for many theories it is undecidable. Researchers study which theories or subsets of theories lead to...
46 KB (4,371 words) - 23:30, 22 May 2025
Collatz conjecture (redirect from Collatz problem)
proved that the problem Given g and n, does the sequence of iterates gk(n) reach 1? is undecidable, by representing the halting problem in this way. Closer...
57 KB (7,098 words) - 17:31, 28 May 2025
Turing machine (category Models of computation)
Journal of Symbolic Logic, 1, 103–105, 1936. Reprinted in The Undecidable, pp. 289ff. Emil Post (1947), "Recursive Unsolvability of a Problem of Thue",...
73 KB (9,420 words) - 13:08, 29 May 2025
amount of resources (computational complexity) solving a given problem will require, and explain why some problems are intractable or undecidable. Solvable...
8 KB (984 words) - 22:51, 16 September 2024