such undecidable languages may be recursively enumerable. Many, if not most, undecidable problems in mathematics can be posed as word problems: determining...

computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an...

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...

lists of problems: List of philosophical problems List of undecidable problems Lists of unsolved problems List of NP-complete problems List of PSPACE-complete...

The halting problem is an important undecidable decision problem; for more examples, see list of undecidable problems. Decision problems can be ordered...

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...

decidabilities. On the top are the undecidable problems. Below it are the decidable problems. Furthermore, the decidable problems can be divided into a complexity...

halting problem is undecidable, meaning that no general algorithm exists that solves the halting problem for all possible program–input pairs. The problem comes...

Recursive set, a "decidable set" in recursion theory Decision problem List of undecidable problems Decision (disambiguation) Decide (disambiguation) This disambiguation...

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...

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...

conductivities List of undecidable problems List of unsolved deaths List of unsolved problems in astronomy List of unsolved problems in biology List of unsolved...

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...

answer the question of whether a given Oracle machine will ever halt. Automata theory Abstract machine List of undecidable problems Computational complexity...

(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é...

amount of resources (computational complexity) solving a given problem will require, and explain why some problems are intractable or undecidable. Solvable...

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...

problems: The domino problem for Wang tiles. The satisfiability problem for first-order logic. Knuth–Bendix completion algorithm List of undecidable problems...

History of the Church–Turing thesis Lambda calculus List of undecidable problems Post correspondence problem Post's theorem Primitive recursive function Recursion...

List of statements undecidable in Z F C {\displaystyle {\mathsf {ZFC}}} Gelfand–Naimark theorem Akemann, Charles; Weaver, Nik (2004), "Consistency of...

ISBN 978-0-85664-464-1. Davis, Martin (1965). The Undecidable: Basic Papers On Undecidable Propositions, Unsolvable Problems and Computable Functions. New York: Raven...

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...

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...

arbitrary formulas are included in the theory. Many important problems are undecidable, that is, it has been proven that no effective method for determining...

statement is independent of ZFC (sometimes phrased "undecidable in ZFC") if it can neither be proven nor disproven from the axioms of ZFC. In 1931, Kurt Gödel...

theorem of 1931, previous examples of undecidable statements (such as the continuum hypothesis) had all been in pure set theory. The Whitehead problem was...

Diophantine equations. In principle, many problems can be reduced to the halting problem. See the list of undecidable problems. Gödel's incompleteness theorems...

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...

constructions of classical geometry, and solving the general quintic equation algebraically. Also provably unsolvable are so-called undecidable problems, such...

Principia Mathematica und verwandter Systeme I" ("On Formally Undecidable Propositions of Principia Mathematica and Related Systems I") is a paper in mathematical...