turing's halting problem
"Turing's halting problem" refers to the mathematical question of whether a program can determine if another program will halt or run forever. It was proved by Alan Turing in 1936 that no algorithm exists to solve this problem for all possible cases.
Requires login.
Related Concepts (1)
Similar Concepts
- alan turing
- cellular automata and turing completeness
- computability
- computability theory
- deterministic turing machine
- godel's incompleteness theorem
- halting problem
- recursion in computer science
- the turing test
- theory of computation
- turing machines
- turing machines and cellular automata
- turing patterns
- turing test
- undecidability