A Simple Discrete System with Chaotic Behavior*


Download Links

by Peter R. J. Asveld

Active Bibliography

1 Post’s system of tag – A simple discrete nonlinear system – Peter R. J. Asveld - 1992
1 Tag systems and Collatz-like functions – Liesbeth De Mol
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
Computer Science Journal of Moldova, vol.9, no.1(25), 2001 Small Universal Circular Post Machines – Manfred Kudlek, Yurii Rogozhin
1 An Inefficient Representation of the Empty Word – Peter R. J. Asveld
Extensions, Automorphisms, and Definability – Robert I. Soare
4 Commutation Problems on Sets of Words and Formal Power Series – Ion Petre - 2002
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
32 Computability and recursion – Robert I. Soare - 1996
2 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results. – Liesbeth De Mol - 2008
Solvability of the halting and reachability problem for binary 2-tag systems – Liesbeth De Mol - 2008
An Undecidable Nested Recurrence Relation – Marcel Celaya, Frank Ruskey - 1203
4 The complexity of small universal Turing machines: a survey – Damien Woods, Turlough Neary - 2007
On the history of martingales in the study of randomness – Laurent Bienvenu, et al. - 2009
The REESSE1+ Public Key Cryptosystem v 2.21 * – Shenghui Su, Shuwang Lü - 2012
A Lightweight Hash Function Resisting Birthday Attack and Meet-in-the-middle Attack – Shenghui Su, Tao Xie, Shuwang Lü
1 Turing’s Thesis – Solomon Feferman
1 The Incomputable Alan Turing – S. Barry Cooper