The following pages link to Turlough Neary (Q487985):
Displayed 24 items.
- Three small universal spiking neural P systems (Q487986) (← links)
- On the computational complexity of spiking neural P systems (Q609034) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Generalized tag systems (Q1798913) (← links)
- 2-state 2-symbol Turing machines with periodic support produce regular sets (Q2401011) (← links)
- Small fast universal Turing machines (Q2508974) (← links)
- Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (Q2509952) (← links)
- Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines (Q2805458) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words (Q2955030) (← links)
- Small Weakly Universal Turing Machines (Q3183617) (← links)
- On the Computational Complexity of Spiking Neural P Systems (Q3543343) (← links)
- A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems (Q3564887) (← links)
- Small Semi-weakly Universal Turing Machines (Q3608492) (← links)
- P-completeness of Cellular Automaton Rule 110 (Q3613755) (← links)
- Small Semi-Weakly Universal Turing Machines (Q3632014) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- The Complexity of Small Universal Turing Machines (Q5425384) (← links)
- Tag Systems and the Complexity of Simple Programs (Q5500609) (← links)
- A Cellular Automaton for Blocking Queen Games (Q5500614) (← links)
- Four Small Universal Turing Machines (Q5901452) (← links)
- Four Small Universal Turing Machines (Q5902079) (← links)
- A cellular automaton for blocking queen games (Q6191204) (← links)