3 ms·
lol! Only flaw there is that the halting problem works on modern computing also :-)
by chris_wot 13y ago
lol! Only flaw there is that the halting problem works on modern computing also :-)
- Robin_Message 13y agoNope, technically it has to be an infinite machine, otherwise it's just an over complicated finite state machine and proving termination in those is trivial. I/O (except to bounded sources like disks) could probably save you, but the proof will be harder.