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.
Also, check out Wolfram’s NKS.
0 responses so far ↓
There are no comments yet...Kick things off by filling out the form below.
Leave a Comment