Follow
Turlough Neary
Turlough Neary
Postdoctoral Researcher, Institute of Neuroinformatics, University of Zurich and ETH Zurich
Verified email at ini.phys.ethz.ch - Homepage
Title
Cited by
Cited by
Year
P-completeness of cellular automaton Rule 110
T Neary, D Woods
International Colloquium on Automata, Languages, and Programming, 132-143, 2006
1302006
The complexity of small universal Turing machines: a survey
T Neary, D Woods
International Conference on Current Trends in Theory and Practice of …, 2012
115*2012
Four small universal Turing machines
T Neary, D Woods
Fundamenta Informaticae 91 (1), 123-144, 2009
106*2009
On the time complexity of 2-tag systems and small universal Turing machines
D Woods, T Neary
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
602006
Small fast universal Turing machines
T Neary, D Woods
Theoretical Computer Science 362 (1-3), 171-195, 2006
482006
Undecidability in binary tag systems and the Post correspondence problem for five pairs of words
T Neary
Proceedings of the 32nd International Symposium on Theoretical Aspects of …, 2015
382015
Small weakly universal Turing machines
T Neary, D Woods
International Symposium on Fundamentals of Computation Theory, 262-273, 2009
362009
On the computational complexity of spiking neural P systems
T Neary
Natural Computing 9, 831-851, 2010
292010
A boundary between universality and non-universality in extended spiking neural P systems
T Neary
International Conference on Language and Automata Theory and Applications …, 2010
272010
Small semi-weakly universal Turing machines
D Woods, T Neary
Fundamenta Informaticae 91 (1), 179-195, 2009
272009
Small universal Turing machines
T Neary
National University of Ireland, Maynooth, 2008
242008
Three small universal spiking neural P systems
T Neary
Theoretical Computer Science 567, 2-20, 2015
202015
A universal spiking neural P system with 11 neurons
T Neary
Proceedings of the Eleventh International Conference on Membrane Computing …, 2010
172010
A small universal spiking neural P system
T Neary
International Workshop on Computing with Biomolecules, 65-74, 2008
92008
A cellular automaton for blocking queen games
M Cook, U Larsson, T Neary
Natural Computing 16, 397-410, 2017
72017
A boundary between universality and non-universality in spiking neural P systems
T Neary
arXiv preprint arXiv:0912.0741, 2009
62009
Small semi-weakly universal Turing machines
T Neary, D Woods
Fundamenta Informaticae 91 (1), 179-195, 2009
52009
Remarks on the computational complexity of small universal Turing machines
D Woods, T Neary
MFCSIT: Fourth Irish Conference on the Mathematical Foundations of Computer …, 2006
42006
Wang’s B machines are efficiently universal, as is Hasenjaeger’s small universal electromechanical toy
T Neary, D Woods, N Murphy, R Glaschick
Journal of Complexity 30 (5), 634-646, 2014
32014
Undecidability in binary tag systems and the Post correspondence problem for four pairs of words
T Neary
arXiv preprint arXiv:1312.6700, 2013
32013
The system can't perform the operation now. Try again later.
Articles 1–20