[Theory] Halting problem

[%u]

== Quote from BCS (none at anon.com)'s article
> Hello %u,
> > Just to be clear about this, the halting problem is only unsolvable
> > for Turing
> > machines.
> More correctly, the halting problem for machine X is unsolvable by machine
> X (or any weaker machine).

I was looking for a way out by making machine X allocate only 32b per program
Except for halt.exe :D
That way you can't create the program which loops if halt halts and is thus a way
out of that argument :)

But thanks, it is a much nicer definition.