pramode_ce (![[info]](http://l-stat.livejournal.com/img/userinfo.gif){kind=small} pramode_ce) wrote,@ 2007-10-25 04:14:00 |
|
Simplest universal Turing machine proved!
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.
