Abstract

We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of ( 3 , 11 ) , ( 5 , 7 ) , ( 6 , 6 ) , ( 7 , 5 ) and ( 8 , 4 ) . These are the smallest known UTMs that simulate Turing machines in polynomial time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call