20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Halting Problem: Computability theory, Decision problem, Computer program, Alan Turing, Algorithm, Turing machine -

English
2026-03-16
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program, decide whether the program finishes running or will run forever. This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever. Alan Turing proved in 1936 that a general algor ... Full description

You May Also Like

Description

In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program, decide whether the program finishes running or will run forever. This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. We say that the halting problem is undecidable over Turing machines. B. Jack Copeland attributes the actual term halting problem to Martin Davis.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786130821272
Write Your Own Review
You're reviewing: Halting Problem: Computability theory, Decision problem, Computer program, Alan Turing, Algorithm, Turing machine
Your Rating:

Goodreads Reviews

€156.58 €195.73