Study of Limits of Solvability in Tag Systems

Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. This result will be situated in a more general context of research on limits of solvability in tag systems. Key words: Tag Systems, Limits of solvability, Reachability problem, Halting Problem

• Type: Conference
• Year: 2007
• Where: MCU
• Authors: Liesbeth De Mol
• Keywords: 2-symbolic Tag Systems, Hardware, MCU 2007, Reachability Problem, Tag Systems