Turlough Neary

According to our database, Turlough Neary authored at least 23 papers between 2006 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

Preface.

Matthew Cook, Turlough Neary

Nat. Comput., 2019

Average-Case Completeness in Tag Systems.

Matthew Cook, Turlough Neary

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Generalized Tag Systems.

Turlough Neary, Matthew Cook

Proceedings of the Reachability Problems - 12th International Conference, 2018

2017

A cellular automaton for blocking queen games.

Matthew Cook, Urban Larsson, Turlough Neary

Nat. Comput., 2017

2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets.

Turlough Neary

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2015

Three small universal spiking neural P systems.

Turlough Neary

Theor. Comput. Sci., 2015

Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines.

Damien Woods, Turlough Neary

Fundam. Informaticae, 2015

Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words.

Turlough Neary

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Tag Systems and the Complexity of Simple Programs.

Turlough Neary, Damien Woods

Proceedings of the Cellular Automata and Discrete Complex Systems, 2015

2014

Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy.

Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick

J. Complex., 2014

2013

Undecidability in binary tag systems and the Post correspondence problem for four pairs of words.

Turlough Neary

CoRR, 2013

2011

Preface.

Damien Woods, Turlough Neary, Anthony Karel Seda

Theor. Comput. Sci., 2011

2010

On the computational complexity of spiking neural P systems.

Turlough Neary

Nat. Comput., 2010

A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems.

Turlough Neary

Proceedings of the Language and Automata Theory and Applications, 2010

2009

The complexity of small universal Turing machines: A survey.

Damien Woods, Turlough Neary

Theor. Comput. Sci., 2009

Small Semi-Weakly Universal Turing Machines.

Damien Woods, Turlough Neary

Fundam. Informaticae, 2009

Four Small Universal Turing Machines.

Turlough Neary, Damien Woods

Fundam. Informaticae, 2009

A boundary between universality and non-universality in spiking neural P systems

Turlough Neary

CoRR, 2009

Small Weakly Universal Turing Machines.

Turlough Neary, Damien Woods

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2007

The Complexity of Small Universal Turing Machines.

Damien Woods, Turlough Neary

Proceedings of the Computation and Logic in the Real World, 2007

2006

Small fast universal Turing machines.

Turlough Neary, Damien Woods

Theor. Comput. Sci., 2006

P-completeness of Cellular Automaton Rule 110.

Turlough Neary, Damien Woods

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On the time complexity of 2-tag systems and small universal Turing machines.

Damien Woods, Turlough Neary

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006