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

TL;DR

This paper surveys theoretical and experimental research on the solvability boundaries of tag systems, highlighting the importance of computer experiments in understanding small tag systems' computational limits.

Contribution

It provides a comprehensive overview of existing results and emphasizes the role of computer experiments in exploring small tag systems' solvability boundaries.

Findings

Survey of older and recent results on tag systems

Highlighting the significance of computer experiments

Insights into the boundaries of solvability and unsolvability

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.