jump to navigation

2,3 Turing Machine October 25, 2007

Posted by Andre Vellino in Logic.
trackback

I wonder if the recent proof  by Alex Smith that the smallest universal turing machine has 2 states and 3 colours is related to the fact that 3-SAT is NP-Complete.  Propositional variables have 2 states (0,1) and 3-SAT is the boolean satisfiability problem for conjunctions of  ternary disjunctions of propositional variables.  This can’t be a coincidence!

Comments»

1. Daniel Lemire - October 27, 2007

Maybe not a bad intuition.

Ok, what this new result means is that you may as well try to solve 3-SAT using a (2,3) Turing machine, right?

So what does it tell us?

Email me if you have more thoughts…


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: