The Complexity of Small Universal Turing Machines: A Survey

Turlough Neary, Damien Woods. The Complexity of Small Universal Turing Machines: A Survey. In Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, György Turán, editors, SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. Proceedings. Volume 7147 of Lecture Notes in Computer Science, pages 385-405, Springer, 2012. [doi]

Abstract

Abstract is missing.