Halting problem


In computability theory the halting problem is a decision problem which can be informally stated as follows: