%0 Conference Paper %B The complexity of simple programs %D 2008 %T On the boundaries of solvability and unsolvability in tag systems. Theoretical and experimental results. %A De Mol, Liesbeth %E Woods, Damien %E Neary, Turlough %E Seda, Tony %X

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.

%B The complexity of simple programs %I Cork University Press %G eng