2000 character limit reached
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results
Published 18 Jun 2009 in cs.CC, cs.DM, and cs.FL | (0906.3329v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
