CSP 2008:
Cork,
Ireland
Turlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy (Eds.):
Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings.
Cork University Press 2008, ISBN 978-1-906642-00-6 
- Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler:
Playing With Population Protocols.
1-14
- Cristian S. Calude:
Simplicity via Provability for Universal Prefix-free Turing Machines.
15-22
- Matteo Cavaliere, Peter Leupold:
Complexity through the Observation of Simple Systems.
23-34
- Matthew Cook:
A Concrete View of Rule 110 Computation.
35-62
- Liesbeth De Mol:
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results.
63-76
- David Doty, Matthew J. Patitz, Scott M. Summers:
Limitations of Self-Assembly at Temperature.
77-8
- Jérôme Durand-Lose:
Abstract geometrical computation 4: small Turing universal signal machines.
89-102
- Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Communications in cellular automata.
103-116
- Markus Holzer, Martin Kutrib, Andreas Malcher:
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems.
117-136
- Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Computational Power of P Systems with Small Size Insertion and Deletion Rules.
137-148
- Manfred Kudlek:
Some Considerations on Universality.
149-156
- Grégory Lafitte:
Busy beavers gone wild.
157-166
- Gene Itkis, Leonid A. Levin:
Simple self-organizing networks.
167-168
- Fred Lunnon:
The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings.
169-190
- Jack H. Lutz:
A Divergence Formula for Randomness and Dimension.
191-200
- Maurice Margenstern:
The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable.
201-214
- Philippe Moser:
A General Notion of Useful Information.
215-224
- Niall Murphy, Damien Woods:
On acceptance conditions for membrane systems: characterisations of L and NL.
225-242
- Alexander Okhotin:
Representing a P-complete problem by small trellis automata.
243-258
- Nicolas Ollinger:
Intrinsically Universal Cellular Automata.
259-266
- Nicolas Ollinger, Gaétan Richard:
A Particular Universal Cellular Automaton.
267-278
- Matthew J. Patitz, Scott M. Summers:
Self-Assembly of Infinite Structures.
279-292
- Klaus Sutner:
Computational Processes and Incompleteness.
293-304
- Sergey Verlan, Yurii Rogozhin:
New Choice for Small Universal Devices: Symport/Antiport P Systems.
305-314
Copyright © Fri Sep 25 19:45:49 2009
by Michael Ley (ley@uni-trier.de)
