9 Trespassing Turing’s Barrier
One fundamental result of theoretical computer science is Alan Turing’s proof (in [
136
]) that it is undecidable to determine whether a computer program will halt or not. This is formally known as the halting problem. We can restrict our attention to Turing machines since they are equivalent in computational power to any “conventional” computer [
26
,
6
].
