Halting Problem: Computability theory, Decision problem, Computer program, Alan Turing, Algorithm, Turing machine -
-20% with code BOOKS
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
More Information
| Publisher | OmniScriptum |
|---|---|
| Release year | 2026 |
| Cover type | Softcover |
| EAN | 9786130821272 |