Lego Turing Machine
legoofdoom.blogspot.com
legoofdoom.blogspot.com
[1] For some definition of "black".
Yes, exactly. Thank you.
The same is true for any model of computation.
Despite this equivalence, it's orders of magnitude harder to program a TM than the ugliest assembly language you've ever seen. This is one architecture that desperately needs a compiler :)
Awesome use of an NXT.
Deleted comment
- Infinite tape*
- Infinite storage*
- Unlimited computability*
*Subject to availability