?

Log in

No account? Create an account

Previous Entry | Next Entry

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.

Read more...

Also, check out Wolfram's NKS.

Latest Month

November 2007
S M T W T F S
    123
45678910
11121314151617
18192021222324
252627282930 
Powered by LiveJournal.com
Designed by heiheneikko