default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTurlough Neary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j11]Matthew Cook, Turlough Neary
:
Preface. Nat. Comput. 18(3): 411-412 (2019)- [c15]Matthew Cook, Turlough Neary:
Average-Case Completeness in Tag Systems. STACS 2019: 20:1-20:17 - 2018
- [c14]Turlough Neary, Matthew Cook:
Generalized Tag Systems. RP 2018: 103-116 - 2017
- [j10]Matthew Cook, Urban Larsson, Turlough Neary:
A cellular automaton for blocking queen games. Nat. Comput. 16(3): 397-410 (2017) - [c13]Turlough Neary:
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets. DCFS 2017: 274-286 - 2016
- [e3]Matthew Cook, Turlough Neary:
Cellular Automata and Discrete Complex Systems - 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings. Lecture Notes in Computer Science 9664, Springer 2016, ISBN 978-3-319-39299-8 [contents] - 2015
- [j9]Damien Woods, Turlough Neary:
Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines. Fundam. Informaticae 138(1-2): 251-258 (2015) - [j8]Turlough Neary:
Three small universal spiking neural P systems. Theor. Comput. Sci. 567: 2-20 (2015) - [c12]Turlough Neary, Damien Woods:
Tag Systems and the Complexity of Simple Programs. Automata 2015: 11-16 - [c11]Matthew Cook, Urban Larsson, Turlough Neary:
A Cellular Automaton for Blocking Queen Games. Automata 2015: 71-84 - [c10]Turlough Neary:
Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words. STACS 2015: 649-661 - 2014
- [j7]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): 634-646 (2014) - 2013
- [e2]Turlough Neary, Matthew Cook:
Proceedings Machines, Computations and Universality 2013, MCU 2013, Zürich, Switzerland, September 9-11, 2013. EPTCS 128, 2013 [contents] - [i7]Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick:
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy. CoRR abs/1304.0053 (2013) - [i6]Turlough Neary:
Undecidability in binary tag systems and the Post correspondence problem for four pairs of words. CoRR abs/1312.6700 (2013) - 2012
- [c9]Turlough Neary, Damien Woods:
The Complexity of Small Universal Turing Machines: A Survey. SOFSEM 2012: 385-405 - 2011
- [j6]Damien Woods, Turlough Neary, Anthony Karel Seda:
Preface. Theor. Comput. Sci. 412(1-2): 1 (2011) - [i5]Turlough Neary, Damien Woods:
The complexity of small universal Turing machines: a survey. CoRR abs/1110.2230 (2011) - 2010
- [j5]Turlough Neary:
On the computational complexity of spiking neural P systems. Nat. Comput. 9(4): 831-851 (2010) - [c8]Turlough Neary:
A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems. LATA 2010: 475-487
2000 – 2009
- 2009
- [j4]Turlough Neary, Damien Woods:
Four Small Universal Turing Machines. Fundam. Informaticae 91(1): 123-144 (2009) - [j3]Damien Woods, Turlough Neary:
Small Semi-Weakly Universal Turing Machines. Fundam. Informaticae 91(1): 179-195 (2009) - [j2]Damien Woods, Turlough Neary:
The complexity of small universal Turing machines: A survey. Theor. Comput. Sci. 410(4-5): 443-450 (2009) - [c7]Turlough Neary, Damien Woods:
Small Weakly Universal Turing Machines. FCT 2009: 262-273 - [e1]Turlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy:
Proceedings International Workshop on The Complexity of Simple Programs, CSP 2008, Cork, Ireland, 6-7th December 2008. EPTCS 1, 2009 [contents] - [i4]Turlough Neary:
A boundary between universality and non-universality in spiking neural P systems. CoRR abs/0912.0741 (2009) - [i3]Turlough Neary:
On the computational complexity of spiking neural P systems. CoRR abs/0912.0928 (2009) - 2008
- [c6]Turlough Neary:
On the Computational Complexity of Spiking Neural P Systems. UC 2008: 189-205 - 2007
- [c5]Damien Woods, Turlough Neary:
The Complexity of Small Universal Turing Machines. CiE 2007: 791-799 - [c4]Turlough Neary, Damien Woods:
Four Small Universal Turing Machines. MCU 2007: 242-254 - [c3]Damien Woods, Turlough Neary:
Small Semi-weakly Universal Turing Machines. MCU 2007: 303-315 - [i2]Turlough Neary, Damien Woods:
Small weakly universal Turing machines. CoRR abs/0707.4489 (2007) - 2006
- [j1]Turlough Neary, Damien Woods:
Small fast universal Turing machines. Theor. Comput. Sci. 362(1-3): 171-195 (2006) - [c2]Damien Woods, Turlough Neary:
On the time complexity of 2-tag systems and small universal Turing machines. FOCS 2006: 439-448 - [c1]Turlough Neary, Damien Woods:
P-completeness of Cellular Automaton Rule 110. ICALP (1) 2006: 132-143 - [i1]Damien Woods, Turlough Neary:
On the time complexity of 2-tag systems and small universal Turing machines. CoRR abs/cs/0612089 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
