The Complexity of Small Universal Turing Machines

  • Authors:

  • Damien Woods;Turlough Neary

  • Affiliations:

  • Department of Computer Science, University College Cork, Ireland;TASS, Department of Computer Science, National University of Ireland Maynooth, Ireland

  • Venue:
  • CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We survey some work concerned with small universal Turing machines, cellular automata, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. As a related result we also find that Rule 110, a well-known elementary cellular automaton, is also efficiently universal. We also mention some new universal program-size results, including new small universal Turing machines and new semi-weakly universal Turing machines. We then discuss some ideas for future work arising out of these, and other, results.