Computer Science – Computational Complexity
Scientific paper
2009-06-18
EPTCS 1, 2009, pp. 56-66
Computer Science
Computational Complexity
Scientific paper
10.4204/EPTCS.1.5
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.
No associations
LandOfFree
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-725397