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

It is a well-known fact that apparently simple systems can give rise to complex behavior. But why exactly does a given system behave in a complex manner? There are two main approaches to tackle this and other related questions. One can take on a theoretical approach or else start from a more experimental study of the behavior of such systems with the help of a computer. In this paper, the experimental approach is applied to tag systems with a very small program size. After a discussion of some of the main theoretical results on tag systems, several results from a computer-assisted and experimental study on tag systems are analyzed. Special attention is given to the well-known example studied by Post with only 2 symbols and a deletion number v=3. These results are combined with some theoretical results on tag systems in order to gain more insight into the computational power of simple tag systems.

[1]  Yurii Rogozhin,et al.  Small Universal Turing Machines , 1996, Theor. Comput. Sci..

[2]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[3]  Emil Post and His Anticipation of Gödel and Turing , 2004 .

[4]  A Question of Numbers , 1996 .

[5]  Pascal Michel,et al.  Small Turing machines and generalized busy beaver competition , 2004, Theor. Comput. Sci..

[6]  Liesbeth De Mol,et al.  Closing the Circle: An Analysis of Emil Post's Early Work , 2006, Bull. Symb. Log..

[7]  Liesbeth De Mol,et al.  Study of Limits of Solvability in Tag Systems , 2007, MCU.

[8]  Klaus Sutner,et al.  Cellular automata and intermediate degrees , 2003, Theor. Comput. Sci..

[9]  Stephen Wolfram,et al.  Cellular Automata And Complexity , 1994 .

[10]  Turlough Neary,et al.  Small Weakly Universal Turing Machines , 2007, FCT.

[11]  J. Neumann.  The General and Logical Theory of Au-tomata , 1963 .

[12]  Marvin Minsky,et al.  Size and structure of universal Turing machines using Tag systems , 1962 .

[13]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[14]  Maurice Margenstern,et al.  Frontier between decidability and undecidability: a survey , 2000, Theor. Comput. Sci..

[15]  Turlough Neary,et al.  P-completeness of Cellular Automaton Rule 110 , 2006, ICALP.

[16]  A. Church.  Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem , 1937 .

[17]  Hiroshi Umeo,et al.  A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem - A Geometrical Approach , 2009, Fundam. Informaticae.

[18]  Liesbeth De Mol,et al.  On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results , 2009, CSP.

[19]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[20]  Turlough Neary,et al.  Small Semi-Weakly Universal Turing Machines , 2007, Fundam. Informaticae.

[21]  Matthew Cook,et al.  Universality in Elementary Cellular Automata , 2004, Complex Syst..

[22]  Hartmut Jürgens,et al.  Chaos and Fractals: New Frontiers of Science , 1992 .

[23]  Liesbeth De Mol.  Solvability of the Halting and Reachability Problem for Binary 2-tag Systems , 2010, Fundam. Informaticae.

[24]  Shen Lin,et al.  Computer Studies of Turing Machine Problems , 1965, JACM.

[25]  Jaime Wisniak,et al.  His life and work , 2002 .

[26]  A. Turing,et al.  On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .

[27]  Allen H. Brady.  The determination of the value of Rado’s noncomputable function Σ() for four-state Turing machines , 1983 .

[28]  J. M. Foster,et al.  Mathematical theory of automata , 1965 .

[29]  Shigeru Watanabe,et al.  5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines , 1961, JACM.

[30]  Dietmar Saupe,et al.  Chaos and fractals - new frontiers of science , 1992 .

[31]  William Leonard Laurence,et al.  New frontiers of science , 1964 .

[32]  Claudio Baiocchi,et al.  Three Small Universal Turing Machines , 2001, MCU.

[33]  John Cocke,et al.  Universality of Tag Systems with P = 2 , 1964, JACM.

[34]  Hao Wang.  Tag systems and lag systems , 1963 .

[35]  Martin Davis,et al.  The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions , 2004 .

[36]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[37]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[38]  Turlough Neary,et al.  Four Small Universal Turing Machines , 2007, Fundam. Informaticae.

[39]  Emil L. Post,et al.  Solvability, provability, definability: the collected works of Emil L. Post , 1994 .

[40]  Liesbeth De Mol.  Tracing unsolvability : a mathematical, historical and philosophical analysis with a special focus on tag systems , 2007 .

[41]  Turlough Neary,et al.  Small Semi-weakly Universal Turing Machines , 2007, MCU.

[42]  Martin D. Davis,et al.  Why Gödel Didn't Have Church's Thesis , 1982, Inf. Control..

[43]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[44]  Manfred Kudlek,et al.  New Small Universal Circular Post Machines , 2001, FCT.

[45]  David Pager,et al.  The Categorization of Tag Systems in Terms of Decidability , 1970 .

[46]  Liesbeth De Mol,et al.  Tag systems and Collatz-like functions , 2008, Theor. Comput. Sci..