Pages

October 25, 2007

Simplest universal turing maching

There is now a proof that the simplest universal turing machine has 2 states 3 colors


This kind of machine would be a simpler and easier target for those working on molecular computing

Turing machines in wikipedia

Universal Turing machines in wikipedia. A turing machine that can simulate all other turing machines

0 comments: