Small Semi-weakly Universal Turing Machines

DOI10.1007/978-3-540-74593-8_26MaRDI QIDQ3608492zbMATH OpenOpenAlexFDO

Authors Damien Woods, Turlough Neary

Publication date 5 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://mural.maynoothuniversity.ie/12415/1/Woods_SmallSemi_2009.pdf

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• Small Semi-Weakly Universal Turing Machines
• Small Weakly Universal Turing Machines
• Four Small Universal Turing Machines
• Four Small Universal Turing Machines
• scientific article; zbMATH DE number 1746682

Cited in

(16)

• The complexity of small universal Turing machines: A survey
• Some small self-describing Turing machines
• Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
• Yurii Rogozhin's contributions to the field of small universal Turing machines
• The Complexity of Small Universal Turing Machines: A Survey
• Small Weakly Universal Turing Machines
• On the Computational Complexity of Spiking Neural P Systems
• Small Semi-Weakly Universal Turing Machines
• Small Semi-Thue System Universal with Respect to the Termination Problem
• A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
• How Redundant Is Your Universal Computation Device?
• Abstract geometrical computation. IV: Small Turing universal signal machines
• On the complex behavior of simple tag systems -- an experimental approach
• Simplicity via provability for universal prefix-free Turing machines
• Reversible computing and cellular automata -- a survey
• Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources

This page was built for publication: Small Semi-weakly Universal Turing Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608492)