MURAL - Maynooth University Research Archive Library



    Items where Author is "Neary, Turlough"


    Up a level
    Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
    Group by: Item Type | Date | No Grouping
    Number of items: 11.

    Article

    Woods, Damien and Neary, Turlough (2015) Yurii Rogozhin’s Contributions to the Field of Small Universal Turing Machines. Fundamenta Informaticae, 137. pp. 1-9. ISSN 0169-2968

    Neary, Turlough and Woods, Damien and Murphy, Niall and Glaschick, Rainer (2014) Wang's B machines are efficiently universal, as is Hasenjaeger’s small universal electromechanical toy. Journal of Complexity, 30 (5). pp. 634-646. ISSN 0885-064X

    Woods, Damien and Neary, Turlough (2009) The complexity of small universal Turing machines: A survey. Theoretical Computer Science, 410 (4-5). pp. 443-450. ISSN 0304-3975

    Neary, Turlough and Woods, Damien (2009) Four Small Universal Turing Machines. Fundamenta Informaticae, 91 (1). pp. 123-144. ISSN 0169-2968

    Woods, Damien and Neary, Turlough (2009) Small Semi-Weakly Universal Turing Machines. Fundamenta Informaticae, 91 (1). pp. 179-195. ISSN 0169-2968

    Neary, Turlough and Woods, Damien (2006) Small fast universal Turing machines. Theoretical Computer Science, 362. pp. 171-195. ISSN 0304-3975

    Neary, Turlough and Woods, Damien (2006) P-completeness of Cellular Automaton Rule 110. Lecture Notes in Computer Science, 4051. pp. 132-143. ISSN 0302-9743

    Book Section

    Neary, Turlough and Woods, Damien (2009) Small weakly universal Turing machines. In: Fundamentals of Computation Theory. Springer Verlag, pp. 267-273. ISBN 3-642-03408-X

    Woods, Damien and Neary, Turlough (2006) On the time complexity of 2-tag systems and small universal Turing machines. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE, pp. 439-448. ISBN 0-7695-2720-5

    Conference or Workshop Item

    Glaschick, Rainer and Neary, Turlough and Woods, Damien and Murphy, Niall (2012) Hasenjaeger's electromechanical small universal Turing machine is time efficient. In: Turing in Context II, October, 2012.

    Woods, Damien and Neary, Turlough (2006) Remarks on the computational complexity of small universal Turing machines. In: Proceedings Of The Fourth International Conference On Information And The Fourth Irish Conference On The Mathematical Foundations Of Computer Science And Information Technology Mfcsit, 2006.

    This list was generated on Thu Mar 28 23:17:45 2024 UTC.