Related articles:
Algorithm
Turing machine
Enumeration
Alan Turing
First-order logic
Roger Penrose
Infinite loop
Key terms:
halting
computable
algorithm
halting problem
turing machine
undecidable
kleene
minsky
natural numbers
parada
unsolvable
automata
rosser
problema
computable function
undefined
halt if
hodges p
alan turing
emil post
does halt
martin davis
decision problem
entscheidungsproblem
blank tape
about natural numbers
axiomatization
weaker form
proof shows
determine whether
finite memory
incompleteness theorem
halts on input
stephen kleene
decide whether
undecidable problem
lambda calculus
solve the halting problem
question whether
arbitrary program
total computable function
will eventually halt
starting state and input represented
undecidability of the halting problem
halt when given the starting
statement about natural numbers
statements about natural numbers
partial halting solver recognizer
if the turing machine represented
halting problem for turing machines
Search external links cited by footnotes on Wikipedia page Halting problem:
|
|