Illogical Arguments in the Name of Alan Turing
by Nitesh Dhanjani
2 Comments
Felix 20071113 04:44:47 
There's another problem with the halting problem argument. The validity of the proof depends on hypothetical computers with an infinite amount of storage. Any machine with finite storage can be analyzed by some machine with a larger finite amount of storage. 
Finlay McWater 20071113 06:13:20 
Another specific (i.e. nongeneral) case is the Java bytecode verifier. It checks compiled Java language progams to see if they meet a set of security criteria (that they don't underflow or overflow the stack, that they don't do some clever stack shenanigans to perform an illegal type conversion and thus break the typedependent security, and so forth).
