Was (wer) ist undecidable - definition
WIKIMEDIA DISAMBIGUATION PAGE
Undecidability; Incomputability; Unsolvability; Undecidable (disambiguation)
undecidable
¦ adjective not able to be firmly established or refuted.
Derivatives
undecidability noun
Undecidable problem
DECISION PROBLEM FOR WHICH IT IS IMPOSSIBLE TO CONSTRUCT AN ALGORITHM THAT ALWAYS LEADS TO A CORRECT YES-OR-NO ANSWER
Undecidable language; Semi-decidable; Undecidable set; Uncomputable problem; Unsolvable problem; Algorithmically insoluble; Algorithmic insolubility; Recursively undecidable; Algorithmically unsolvable 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 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 arbitrary programs eventually halt when run.
List of undecidable problems
WIKIMEDIA LIST ARTICLE
List of undecidable problem
In computability theory, an undecidable problem is a type of computational problem that requires a yes/no answer, but where there cannot possibly be any computer program that always gives the correct answer; that is, any possible program would sometimes give the wrong answer or run forever without giving any answer. More formally, an undecidable problem is a problem whose language is not a recursive set; see the article Decidable language.
Wikipedia
Undecidable
Undecidable may refer to:
- Undecidable problem in computer science and mathematical logic, a decision problem that no algorithm can decide, formalized as an undecidable language or undecidable set
- "Undecidable", sometimes also used as a synonym of independent, something that can neither be proved nor disproved within a mathematical theory
- Undecidable figure, a two-dimensional drawing of something that cannot exist in 3d, such as appeared in some of the works of M. C. Escher
