Study of Limits of Solvability in Tag Systems

DOI10.1007/978-3-540-74593-8_15MaRDI QIDQ3608480zbMATH OpenOpenAlexFDO

Authors Liesbeth De Mol

Publication date 5 March 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-74593-8_15

zbMATH Keywords

reachability problemhalting problemtag systemslimits of solvability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Thue and Post systems, etc. (03D03)

Recommendations

• On the boundaries of solvability and unsolvability in tag systems. Theoretical and experimental results
• Tag systems and Collatz-like functions
• Tag systems and the complexity of simple programs
• scientific article; zbMATH DE number 7654728
• On the complex behavior of simple tag systems -- an experimental approach

Cited in

(6)

• The complexity of small universal Turing machines: A survey
• On the complex behavior of simple tag systems -- an experimental approach
• scientific article; zbMATH DE number 7654728 (Why is no real title available?)
• The Complexity of Small Universal Turing Machines: A Survey
• Tag systems and Collatz-like functions
• On the boundaries of solvability and unsolvability in tag systems. Theoretical and experimental results

This page was built for publication: Study of Limits of Solvability in Tag Systems

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