Simplest universal Turing machine proved!
Published on: 2007-10-25
Simplest universal Turing machine proved!
2007-10-25T04:14:00
It seems bizarre that we should be able to achieve universal computation with a machine as simple as the one above--that we can find just by doing a little searching in the space of possible machines. But that's the new intuition that we get from NKS. That in the computational universe, phenomena like universality are actually quite common--even among systems with very simple rules. Read more... Also, check out Wolfram's NKS.