Turlough Neary

Publication Activity (10 Years)

Years Active: 2006-2019
Publications (10 Years): 10

Top Topics

Pattern Generation

Imperfect Information

Hebbian Learning

Top Venues

Publications

Matthew Cook, Turlough Neary
Preface. Nat. Comput. 18 (3) (2019)
Matthew Cook, Turlough Neary
Average-Case Completeness in Tag Systems. STACS (2019)
Turlough Neary, Matthew Cook
Generalized Tag Systems. RP (2018)
Turlough Neary
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets. DCFS (2017)
Matthew Cook, Urban Larsson, Turlough Neary
A cellular automaton for blocking queen games. Nat. Comput. 16 (3) (2017)
Matthew Cook, Urban Larsson, Turlough Neary
A Cellular Automaton for Blocking Queen Games. Automata (2015)
Damien Woods, Turlough Neary
Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines. Fundam. Informaticae 138 (1-2) (2015)
Turlough Neary
Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words. STACS (2015)
Turlough Neary, Damien Woods
Tag Systems and the Complexity of Simple Programs. Automata (2015)
Turlough Neary
Three small universal spiking neural P systems. Theor. Comput. Sci. 567 (2015)
Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy. J. Complex. 30 (5) (2014)
Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy CoRR (2013)
Turlough Neary
Undecidability in binary tag systems and the Post correspondence problem for four pairs of words. CoRR (2013)
Turlough Neary, Damien Woods
The Complexity of Small Universal Turing Machines: A Survey. SOFSEM (2012)
Turlough Neary, Damien Woods
The complexity of small universal Turing machines: a survey CoRR (2011)
Damien Woods, Turlough Neary, Anthony Karel Seda
Preface. Theor. Comput. Sci. 412 (1-2) (2011)
Turlough Neary
On the computational complexity of spiking neural P systems. Nat. Comput. 9 (4) (2010)
Turlough Neary
A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems. LATA (2010)
Damien Woods, Turlough Neary
Small Semi-Weakly Universal Turing Machines. Fundam. Informaticae 91 (1) (2009)
Turlough Neary, Damien Woods
Four Small Universal Turing Machines. Fundam. Informaticae 91 (1) (2009)
Turlough Neary, Damien Woods
Small Weakly Universal Turing Machines. FCT (2009)
Damien Woods, Turlough Neary
The complexity of small universal Turing machines: A survey. Theor. Comput. Sci. 410 (4-5) (2009)
Turlough Neary
A boundary between universality and non-universality in spiking neural P systems CoRR (2009)
Turlough Neary
On the computational complexity of spiking neural P systems CoRR (2009)
Turlough Neary
On the Computational Complexity of Spiking Neural P Systems. UC (2008)
Damien Woods, Turlough Neary
Small Semi-weakly Universal Turing Machines. MCU (2007)
Damien Woods, Turlough Neary
The Complexity of Small Universal Turing Machines. CiE (2007)
Turlough Neary, Damien Woods
Small weakly universal Turing machines CoRR (2007)
Turlough Neary, Damien Woods
Four Small Universal Turing Machines. MCU (2007)
Damien Woods, Turlough Neary
On the time complexity of 2-tag systems and small universal Turing machines. FOCS (2006)
Damien Woods, Turlough Neary
On the time complexity of 2-tag systems and small universal Turing machines CoRR (2006)
Turlough Neary, Damien Woods
Small fast universal Turing machines. Theor. Comput. Sci. 362 (1-3) (2006)
Turlough Neary, Damien Woods
P-completeness of Cellular Automaton Rule 110. ICALP (1) (2006)