Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Halting Problem - Has anyone solved the halting problem?


Alan Turing, in 1936, demonstrated that the halting problem, in relation to Turing machines, is undecidable. In other words, no Turing machine can accurately decide (stop and provide the correct answer) for all potential program/input combinations.