Post’s system of tag – A simple discrete nonlinear system (1992)

by Peter R. J. Asveld
Venue:Center for Theoretical Physics, University of Twente, Enschede, The Netherlands
Citations:1 - 1 self

Active Bibliography

A Simple Discrete System with Chaotic Behavior* – Peter R. J. Asveld
1 Tag systems and Collatz-like functions – Liesbeth De Mol
1 An Inefficient Representation of the Empty Word – Peter R. J. Asveld
Solvability of the halting and reachability problem for binary 2-tag systems – Liesbeth De Mol - 2008
Internal Examiner: Dr. James Power – Turlough Neary, Supervisors Dr, Damien Woods, Dr. J. Paul Gibson, External Examiner, Prof Maurice Margenstern, Department Head, Dr. Adam Winstanley, Maurice Margenstern, Yurii Rogozhin, Manfred Kudlek, Liesbeth De Mol, Fred Lunnon, Ronan Reilly, James Power
4 Commutation Problems on Sets of Words and Formal Power Series – Ion Petre - 2002
1 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007
Extensions, Automorphisms, and Definability – Robert I. Soare
1 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
25 Computability and recursion – Robert I. Soare - 1996
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results. – Liesbeth De Mol - 2008
2 The complexity of small universal Turing machines: a survey – Damien Woods, Turlough Neary - 2007
13 On the time complexity of 2-tag systems and small universal turing machines – Damien Woods, Turlough Neary - 2006
1 The Incomputable Alan Turing – S. Barry Cooper
Computing Science A Question of Numbers – Brian Hayes
Date Title Source Jan-Feb, 1996 A Question of Numbers American Scientist, Vol 84 A Question of Numbers – Brian Hayes
3 Church’s Thesis and the Conceptual Analysis of Computability – Michael Rescorla - 2007
5 Computing technology for learning- in need of a radical new conception – Meurig Beynon
Computing Science A Question of Numbers – Neil Sloane, Brian Hayes