3 ms·

These are not simulating a Turing Machine, they are computationally equivalent to a Turing Machine (for practical purposes). I am adding the practical purposes

These are not simulating a Turing Machine, they are computationally equivalent to a Turing Machine (for practical purposes). I am adding the practical purposes disclaimer because an x86 has limited memory which makes it actually just computationally equivalent to a finite state automaton.

zinkem 11y ago
In all honesty, I think it'd be more interesting to see analysis of turing complete OISCs than repeatedly seeing these minified homework solutions posted to HN
- nilliams 11y ago
  In all honesty, I think it'd be more more interesting to see cat pics than repeatedly seeing these your-work-is-less-deserving-than-the-hypothetical-post-I-just-thought-of-yet-haven't-put-any-work-into-nor-written comments posted to HN
  - zinkem 11y ago
    so post some cat pics then