Turlough Neary
Position:
Postdoc --
ended Mar 2020
Email:
tneary@ini.uzh.ch
Work phone:
Home page:
http://www.ini.uzh.ch/~tneary
Location:
55g85-d9
I am a research scientist in the group of Matthew Cook. My area of research is theoretical computer science, with my main interest lying in models of computation and computational complexity. I am particularly interested in the search for simple Turing universal models and their time/space computational complexity.
Supervisor
Matthew Cook
Publications
2019
Matthew Cook and Turlough Neary
Average-Case Completeness in Tag Systems
,
Leibniz International Proceedings in Informatics
, 126: 20:1-20:17, 2019
2017
Matthew Cook, Urban Larsson, Turlough Neary
A cellular automaton for blocking queen games
,
Natural Computing
, 16 :(3) 397-410 , 2017
Turlough Neary
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets
,
Descriptional Complexity of Formal Systems
, 10316: 274-286, 2017
2015
Neary, T.
Three small universal spiking neural P systems
,
Theoretical Computer Science
, 567: 2-20, 2015
Neary, T.
Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
,
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015
, LIPIcs 30 : 649-661, 2015
Cook, M. and Larsson, U. and Neary, T.
A Cellular Automaton for Blocking Queen Games
,
Cellular Automata and Discrete Complex Systems
71-84, 2015
Neary, Turlough and Woods, Damien
Tag Systems and the Complexity of Simple Programs
,
Cellular Automata and Discrete Complex Systems
11-16, 2015
Neary, Turlough and Woods, Damien
Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines
,
Automata, Universality, Computation
117-126, 2015
2014
Neary, Turlough and Woods, Damien and Murphy, Niall and Glaschick, Rainer
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
,
Journal of Complexity
, 30:(5) 634-646, 2014
back
back