On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results.

Liesbeth De Mol

Several older and more recent results on the boundaries of solvability and unsolvability in tag systems are surveyed. Emphasis will be put on the significance of computer experiments in research on very small tag systems.

In Turlough Neary, Damien Woods, Tony Seda and Niall Murphy: Proceedings International Workshop on The Complexity of Simple Programs (CSP 2008), Cork, Ireland, 6-7th December 2008, Electronic Proceedings in Theoretical Computer Science 1, pp. 56–66.
Published: 25th June 2009.
ArXived at: https://dx.doi.org/10.4204/EPTCS.1.5 bibtex PDF
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org