Study of limits of solvability in tag systems

Authors:
Liesbeth De Mol
Affiliations:
Center for Logic and Philosophy of Science, University of Ghent, Gent, Belgium
Venue:
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Year:
2007

Citing 3
Cited 5

Frontier between decidability and undecidability: a survey

Theoretical Computer Science - Special issue on universal machines and computations
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
Tag systems and Collatz-like functions

Theoretical Computer Science

Tag systems and Collatz-like functions

Theoretical Computer Science
The complexity of small universal Turing machines: A survey

Theoretical Computer Science
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems

Fundamenta Informaticae
On the complex behavior of simple tag systems-An experimental approach

Theoretical Computer Science
The complexity of small universal turing machines: a survey

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.