Turlough Neary

36 papers A* 1A 2B 2C 6Journal 18Unranked 5
YearRankTypeTitle / Venue / Authors
2019 A conf
Average-Case Completeness in Tag Systems.
STACS
Matthew Cook, Turlough Neary
2019 J jnl
Preface.
Nat. Comput.
Matthew Cook, Turlough Neary
2018 — conf
Generalized Tag Systems.
RP
Turlough Neary, Matthew Cook
2017 — conf
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets.
DCFS
Turlough Neary
2017 J jnl
A cellular automaton for blocking queen games.
Nat. Comput.
Matthew Cook, Urban Larsson, Turlough Neary
2016 — ed.
Cellular Automata and Discrete Complex Systems - 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings
AUTOMATA
Matthew Cook, Turlough Neary
2015 — conf
A Cellular Automaton for Blocking Queen Games.
Automata
Matthew Cook, Urban Larsson, Turlough Neary
2015 — conf
Tag Systems and the Complexity of Simple Programs.
Automata
Turlough Neary, Damien Woods
2015 J jnl
Three small universal spiking neural P systems.
Theor. Comput. Sci.
Turlough Neary
2015 A conf
Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words.
STACS
Turlough Neary
2015 J jnl
Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines.
Fundam. Informaticae
Damien Woods, Turlough Neary
2014 J jnl
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy.
J. Complex.
Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick
2013 C ed.
Proceedings Machines, Computations and Universality 2013, MCU 2013, Zürich, Switzerland, September 9-11, 2013.
MCU
Turlough Neary, Matthew Cook
2013 J jnl
Undecidability in binary tag systems and the Post correspondence problem for four pairs of words.
CoRR
Turlough Neary
2013 J jnl
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
CoRR
Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick
2012 B conf
The Complexity of Small Universal Turing Machines: A Survey.
SOFSEM
Turlough Neary, Damien Woods
2011 J jnl
Preface.
Theor. Comput. Sci.
Damien Woods, Turlough Neary, Anthony Karel Seda
2011 J jnl
The complexity of small universal Turing machines: a survey
CoRR
Turlough Neary, Damien Woods
2010 C conf
A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems.
LATA
Turlough Neary
2010 J jnl
On the computational complexity of spiking neural P systems.
Nat. Comput.
Turlough Neary
2009 J jnl
A boundary between universality and non-universality in spiking neural P systems
CoRR
Turlough Neary
2009 J jnl
Four Small Universal Turing Machines.
Fundam. Informaticae
Turlough Neary, Damien Woods
2009 J jnl
On the computational complexity of spiking neural P systems
CoRR
Turlough Neary
2009 — ed.
Proceedings International Workshop on The Complexity of Simple Programs, CSP 2008, Cork, Ireland, 6-7th December 2008.
CSP
Turlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy
2009 J jnl
Small Semi-Weakly Universal Turing Machines.
Fundam. Informaticae
Damien Woods, Turlough Neary
2009 B conf
Small Weakly Universal Turing Machines.
FCT
Turlough Neary, Damien Woods
2009 J jnl
The complexity of small universal Turing machines: A survey.
Theor. Comput. Sci.
Damien Woods, Turlough Neary
2008 C conf
On the Computational Complexity of Spiking Neural P Systems.
UC
Turlough Neary
2007 C conf
Four Small Universal Turing Machines.
MCU
Turlough Neary, Damien Woods
2007 C conf
Small Semi-weakly Universal Turing Machines.
MCU
Damien Woods, Turlough Neary
2007 J jnl
Small weakly universal Turing machines
CoRR
Turlough Neary, Damien Woods
2007 C conf
The Complexity of Small Universal Turing Machines.
CiE
Damien Woods, Turlough Neary
2006 J jnl
On the time complexity of 2-tag systems and small universal Turing machines
CoRR
Damien Woods, Turlough Neary
2006 A* conf
On the time complexity of 2-tag systems and small universal Turing machines.
FOCS
Damien Woods, Turlough Neary
2006 — conf
P-completeness of Cellular Automaton Rule 110.
ICALP (1)
Turlough Neary, Damien Woods
2006 J jnl
Small fast universal Turing machines.
Theor. Comput. Sci.
Turlough Neary, Damien Woods