No subject
<> on
Wed Sep 5 08:29:31 UTC 2007
After all, we're used to computers whose CPUs have been carefully engineered,
with millions of gates.
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.
It's just that in our normal efforts of engineering, we've been too
constrained to see with such things.
More information about the tt
mailing list