Flaw in Halting Problem Proofs
Thursday, April 16, 2009 11:14:59 PM
Flaw in Halting Problem Proofs[pdf]
It's based on a single point. I believe this to be the simplest and best explanation I've come up with yet. I'm glad to see that more people are starting to realize that the Halting Problem Proof is nothing more than a parlor trick that has nothing to do with computing. More than that, it is a very specific problem that only applies to one particular type of computing machine. For example, dataflow doesn't really have a concept of halting. Dataflow can produce multiple results, at different times, and the network can continue to be active afterwards.
But my paper doesn't talk about those issues. It revolves around the way the proofs are framed and one critical assumption that is taken as absolute, and is ultimately incorrect.
I post my paper here for reference. It does not include citations of other work because I'm not building on someone's idea. And it's quite a simple issue.