Small Weakly Universal Turing Machines

We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right. They simulate Rule 110 and are currently the smallest known weakly universal Turing machines. Despite their small size these machines are efficient polynomial time simulators of Turing machines.

• Type: Conference
• Year: 2009
• Where: FCT
• Authors: Turlough Neary, Damien Woods
• Keywords: FCT 2009, Polynomial Time Simulators, Small Universal Turing, Theoretical Computer Science, Universal Turing Machines