Halting Problem
- is a type of non-computable problem
- is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever
- is undecidable, meaning that no general algorithm exists that solves the halting problem for all possible program–input pairs