MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Small Universal Turing Machines." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

12 documents found, showing 1 through 10. Next 10 →

ATOM

The complexity of small universal Turing machines
by Turlough Neary, Damien Woods — 2007 — Computability in Europe 2007, volume 4497 of LNCS
…Four small universal Turing machines Turlough Neary 1 and Damien Woods 2 1 TASS, Department…
Cited by 2 (0 self) – Add To MetaCart

Remarks on the computational complexity of small universal Turing machines
by Damien Woods, Turlough Neary — 2006 — Fourth Irish Conference on the Mathematical Foundations of Computer Science and Information Technology
…Remarks on the computational complexity of small universal Turing machines Damien Woods ∗ School…
Cited by 1 (1 self) – Add To MetaCart

IOS Press Four Small Universal Turing Machines
by Damien Woods
… Turing machines in polynomial time. Keywords: small universal Turing machine, 2-tag system, bi…
Add To MetaCart

On the time complexity of 2-tag systems and small universal turing machines
by Damien Woods, Turlough Neary — 2006 — In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS
…On the time complexity of 2-tag systems and small universal Turing machines ∗ Damien Woods Boole…
Cited by 5 (3 self) – Add To MetaCart

Small semi-weakly universal Turing machines
by Damien Woods, Turlough Neary — 2007 — Machines, Computations and Universality (MCU), volume 4664 of LNCS
…Small semi-weakly universal Turing machines Damien Woods 1 and Turlough Neary 2 1 Department…
Cited by 3 (2 self) – Add To MetaCart

A small fast universal Turing machine
by Turlough Neary, Damien Woods — 2005 — Theoretical Computer Science
…A small fast universal Turing machine Turlough Neary 1 and Damien Woods 2 1 Theoretical Aspects…
Cited by 9 (6 self) – Add To MetaCart

P-completeness of cellular automaton Rule 110
by Turlough Neary, Damien Woods — 2006 — In International Colloquium on Automata Languages and Programming (ICALP), volume 4051 of LNCS
… corollary we find that the small universal Turing machines of Mathew Cook run in polynomial time…
Cited by 5 (3 self) – Add To MetaCart

Explicit Universal Splicing
by Gordon Alford Turku, Gordon Alford
… of the universal type-0 grammar described in Calude and Paun [3]. Various other small universal Turing machines…
Add To MetaCart

Undecidable Problems for Probabilistic Automata of Fixed Dimension
by Vincent Blondel, Vincent Canterini — 2001 — Theory of Computing Systems
… universal Turing machine encoding and sharp bounds on small universal Turing machines taken from [Rog96…
Cited by 17 (2 self) – Add To MetaCart

Rodríguez-Patón: Symport/antiport P systems with three objects are universal
by Gheorghe Păun, Juan Pazos, Mario J. Pérez-jiménez, Alfonso Rodríguez-patón — 2005 — Fundamenta Informaticae
… that there are small universal Turing machines (with the size estimated in both the number of tape symbols…
Cited by 10 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB