OurBigBook About$ Donate
 Sign in Sign up

Halting problem

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Theoretical computer science Theory of computation
 1 By others on same topic  0 Discussions Create my own version
The Halting problem is a fundamental concept in computability theory, introduced by British mathematician and logician Alan Turing in 1936. It is a decision problem that can be stated as follows: Given a description of a program (or Turing machine) and an input, determine whether the program finishes running (halts) or continues to run indefinitely. Turing proved that there is no general algorithm that can solve the Halting problem for all possible program-input pairs.

 Ancestors (6)

  1. Theory of computation
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Halting problem by Ciro Santilli 37 Updated 2025-07-16
 View more
The canonical undecidable problem.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook