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

About The Author


Add comment

E-mail is already registered on the site. Please use the Login form or enter another.

You entered an incorrect username or password

Sorry, you must be logged in to post a comment.