Study of Limits of Solvability in Tag Systems

DOI10.1007/978-3-540-74593-8_15zbMath1211.03058OpenAlexW1494202856MaRDI QIDQ3608480

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

halting problemreachability problemtag systemslimits of solvability

Mathematics Subject Classification ID

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

Related Items (4)

The Complexity of Small Universal Turing Machines: A Survey ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Tag systems and Collatz-like functions ⋮ The complexity of small universal Turing machines: A survey

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