Reproducing the cyclic tag system developed by Matthew Cook with Rule 110 using the phases f1_1

Martinez, G. J., McIntosh, H. V., Mora, J. C. and Vergara, S. V. (2011) Reproducing the cyclic tag system developed by Matthew Cook with Rule 110 using the phases f1_1. Journal of Cellular Automata, 6 (2-3). pp. 121-161. ISSN 1557-5969

[img]
Preview
PDF - Accepted Version
9MB

Publisher's URL: http://www.oldcitypublishing.com/JCA/JCAcontents/J...

Abstract

This paper implements the cyclic tag system (CTS) in Rule 110 developed by Cook in [1, 2] using regular expressions denominated phases fi_1 [3]. The main problem in CTS is coding the initial condition based in a system of gliders. In this way, we develop a method to control the periodic phases of the strings representing all gliders until now known in Rule 110, including glider guns. These strings form a subset of regular expressions implemented in a computational system to facilitate the construction of CTS. Thus, these phases are useful to establish distances and positions for every glider and then to delineate more sophisticated components or packages of gliders. In this manuscript, it is possible to find differences with the results exposed in Wolfram's book [2], inclusively some mistakes which avoid to obtain an appropriated realization of CTS in Rule 110; fortunately, these irregularities were discussed and clarified by Cook.

Item Type:Article
Uncontrolled Keywords:cyclic tag system, rule 110
Faculty/Department:Faculty of Environment and Technology
ID Code:10574
Deposited By: A. Lawson
Deposited On:26 Jul 2010 11:25
Last Modified:12 Aug 2013 20:42

Request a change to this item

Total Document Downloads in Past 12 Months

Document Downloads

Total Document Downloads

More statistics for this item...
Copyright 2013 © UWE better together