Small Weakly Universal Turing Machines

DOI10.1007/978-3-642-03409-1_24zbMath1252.68118arXiv0707.4489OpenAlexW2156308118MaRDI QIDQ3183617

Damien Woods, Turlough Neary

Publication date: 20 October 2009

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.4489

Mathematics Subject Classification ID

Related Items (10)

The Complexity of Small Universal Turing Machines: A Survey ⋮ Universal Sleptsov net ⋮ Universality in Infinite Petri Nets ⋮ Abstract geometrical computation. IV: Small Turing universal signal machines ⋮ A simple P-complete problem and its language-theoretic representations ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami ⋮ Three small universal spiking neural P systems ⋮ A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length ⋮ Turing patterns with Turing machines: emergence and low-level structure formation

This page was built for publication: Small Weakly Universal Turing Machines