- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Turlough Neary, Damien Woods
- ICALP
- 2006

We show that the problem of predicting t steps of the 1D cellular automaton Rule 110 is P-complete. The result is found by showing that Rule 110 simulates deterministic Turing machines in polynomial… (More)

- Turlough Neary, Damien Woods
- Fundam. Inform.
- 2009

- Turlough Neary, Damien Woods
- FCT
- 2007

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… (More)

- Turlough Neary
- 2008

Numerous results for simple computationally universal systems are presented, with a particular focus on small universal Turing machines. These results are towards finding the simplest universal… (More)

- Turlough Neary, Damien Woods
- Theor. Comput. Sci.
- 2006

We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of (3, 11), (5, 7), (6, 6), (7, 5) and (8, 4). These are the smallest known UTMs that simulate Turing… (More)

- Damien Woods, Turlough Neary
- Theor. Comput. Sci.
- 2009

We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example, it has been an open question for some time as… (More)

- Turlough Neary
- UC
- 2008

It is shown that there is no standard spiking neural P system that simulates Turing machines with less than exponential time and space overheads. The spiking neural P systems considered here have a… (More)

- Turlough Neary
- STACS
- 2013

Since Cocke and Minsky proved 2-tag systems universal, they have been extensively used to prove the universality of numerous computational models. Unfortunately, all known algorithms give universal… (More)

- Turlough Neary, Damien Woods
- SOFSEM
- 2012

We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as… (More)

- Damien Woods, Turlough Neary
- 47th Annual IEEE Symposium on Foundations of…
- 2006

We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing machines in polynomial… (More)