Open AccessSolvability of the Halting and Reachability Problem for Binary 2-tag Systems
Author(s) -
Liesbeth De Mol
Publication year - 2010
Publication title -
fundamenta informaticae
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.311
H-Index - 67
eISSN - 1875-8681
pISSN - 0169-2968
DOI - 10.3233/fi-2010-257
Subject(s) - reachability , halting problem , binary number , computer science , mathematics , theoretical computer science , discrete mathematics , algorithm , arithmetic , turing machine , computation
International audienceIn this paper a detailed proof will be given of the solvability of the halting and reachability problem for binary 2-tag systems
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom