Thank you very much for the share Yahweh
From Wikipedia, the free encyclopedia
Jump to: navigation, search
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.
i guess it's now time to take some decision.
Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.
i heard people say the same about portable computers not so long ago.