54 citations · 71 across the 8 of their papers we have counts for
10 papers
A Cellular Automaton for Blocking Queen Games
Matthew Cook, Urban Larsson, Turlough Neary
We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game,…
Undecidability in binary tag systems and the Post correspondence problem for four pairs of words
Turlough Neary
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 algorith…
Proceedings Machines, Computations and Universality 2013
Turlough Neary, Matthew Cook
This volume contains the papers presented at the 6th conference on Machines, Computations and Universality (MCU 2013). MCU 2013 was held in Zurich, Switzerland, September 9-11, 201…
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
Turlough Neary, Damien Woods, Niall Murphy +1
In the 1960's Gisbert Hasenjaeger built Turing Machines from electromechanical relays and uniselectors. Recently, Glaschick reverse engineered the program of one of these machines…
The complexity of small universal Turing machines: a survey
Turlough Neary, Damien Woods
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…
On the computational complexity of spiking neural P systems
Turlough Neary
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 consi…