Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Turlough Neary"'
Autor:
Prajwal Prajwal, Turlough Neary, Katja Rohrbach, Pascal Bittel, Pauline C. Göller, Thorsten Buch, Sebastian Dümcke, Peter M. Keller
Publikováno v:
Frontiers in Microbiology, Vol 14 (2023)
IntroductionTuberculosis (TB) is an infectious disease caused by the group of bacterial pathogens Mycobacterium tuberculosis complex (MTBC) and is one of the leading causes of death worldwide. Timely diagnosis and treatment of drug-resistant TB is a
Externí odkaz:
https://doaj.org/article/fd0e3d5231d24bafb23cee7ff66b3a3d
Autor:
Matthew Cook, Turlough Neary
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030002497
RP
RP
Tag systems and cyclic tag systems are forms of rewriting systems which, due to the simplicity of their rewrite rules, have become popular targets for reductions when proving universality/undecidability results. They have been used to prove such resu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d41522cb77637bdf0484a7e13f243ce1
https://doi.org/10.1007/978-3-030-00250-3_8
https://doi.org/10.1007/978-3-030-00250-3_8
Autor:
Matthew Cook, Turlough Neary
Publikováno v:
Natural Computing. 18:411-412
Autor:
Turlough Neary
Publikováno v:
Theoretical Computer Science
In this work we give three small spiking neural P systems. We begin by constructing a universal spiking neural P system with extended rules and only 4 neurons. This is the smallest possible number of neurons for a universal system of its kind. We pro
Autor:
Damien Woods, Turlough Neary
Publikováno v:
Fundamenta Informaticae
In the field of small universal Turing machines, Yurii Rogozhin holds a special prize: he was first to close off an infinite number of open questions by drawing a closed curve that separates the infinite set of Turing machines that are universal from
Autor:
Turlough Neary
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783319602516
DCFS
Lecture Notes in Computer Science
19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.274-286, ⟨10.1007/978-3-319-60252-3_22⟩
DCFS
Lecture Notes in Computer Science
19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.274-286, ⟨10.1007/978-3-319-60252-3_22⟩
Part 2: Contributed Papers; International audience; We say that a Turing machine has periodic support if there is an infinitely repeated word to the left of the input and another infinitely repeated word to the right. In the search for the smallest u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c85cc003b007c32180fd74af0fda098b
https://doi.org/10.1007/978-3-319-60252-3_22
https://doi.org/10.1007/978-3-319-60252-3_22
Autor:
Matthew Cook, Turlough Neary
This volume constitutes the thoroughly refereed proceedings of the 22nd IFIP WG 1.5International Workshop on Cellular Automata and Discrete ComplexSystems, AUTOMATA 2016, held in Zurich, Switzerland, in June 2016.This volume contains 3 invited talks
Autor:
Turlough Neary
Publikováno v:
Natural Computing. 9:831-851
It is shown here that there is no standard spiking neural P system that simulates Turing machines with less than exponential time and space overheads. The spiking neural P systems considered here have a constant number of neurons that is independent
Autor:
Damien Woods, Turlough Neary
Publikováno v:
Theoretical Computer Science. 410(4-5):443-450
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machi
Autor:
Turlough Neary, Damien Woods
Publikováno v:
Fundamenta Informaticae. 91:123-144
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). These machines simulate our new variant of tag system, the bi-tag system and are the smallest known single-tape universal Turing machines with 5, 4, 3