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