3 ms·
Because Turing machines are so cumbersome compared to lambda calculus that a universal Turing machine takes thousands of bits [1]. [1] http://www.verostko.com/
by tromp 4y ago
Because Turing machines are so cumbersome compared to lambda calculus that a universal Turing machine takes thousands of bits [1].
[1] http://www.verostko.com/tur-doc.html#B0,%20Universal%20Turing%20Machine0 http://www.verostko.com/tur-doc.html#B0,%20Universal%20Turin...
- deleted 4y ago[deleted]