Generalized tag systems

DOI10.1007/978-3-030-00250-3_8MaRDI QIDQ1798913zbMATH OpenOpenAlexFDO

Authors Turlough Neary, Matthew Cook

Publication date 23 October 2018

Full work available at URL https://doi.org/10.1007/978-3-030-00250-3_8

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

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

Cited in

(6)

• Undecidability in binary tag systems and the Post correspondence problem for five pairs of words
• On the complex behavior of simple tag systems -- an experimental approach
• Reproducing the cyclic tag system developed by Matthew Cook with Rule 110 using the phases \(f_{i_-}1\)
• Predicting the large-scale evolution of tag systems
• On the boundaries of solvability and unsolvability in tag systems. Theoretical and experimental results
• Tag systems and Collatz-like functions

This page was built for publication: Generalized tag systems

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