Abstract is missing.
- Playing With Population ProtocolsOlivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler. 1-14
- Simplicity via Provability for Universal Prefix-free Turing MachinesCristian S. Calude. 15-22
- Complexity through the Observation of Simple SystemsMatteo Cavaliere, Peter Leupold. 23-34
- A Concrete View of Rule 110 ComputationMatthew Cook. 35-62
- On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental ResultsLiesbeth De Mol. 63-76
- Limitations of Self-Assembly at TemperatureDavid Doty, Matthew J. Patitz, Scott M. Summers. 77-8
- Abstract geometrical computation 4: small Turing universal signal machinesJérôme Durand-Lose. 89-102
- Communications in cellular automataEric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier. 103-116
- Multi-Head Finite Automata: Characterizations, Concepts and Open ProblemsMarkus Holzer, Martin Kutrib, Andreas Malcher. 117-136
- Computational Power of P Systems with Small Size Insertion and Deletion RulesAlexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan. 137-148
- Some Considerations on UniversalityManfred Kudlek. 149-156
- Busy beavers gone wildGrégory Lafitte. 157-166
- Simple self-organizing networksGene Itkis, Leonid A. Levin. 167-168
- The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic TilingsFred Lunnon. 169-190
- A Divergence Formula for Randomness and DimensionJack H. Lutz. 191-200
- The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidableMaurice Margenstern. 201-214
- A General Notion of Useful InformationPhilippe Moser. 215-224
- On acceptance conditions for membrane systems: characterisations of L and NLNiall Murphy, Damien Woods. 225-242
- Representing a P-complete problem by small trellis automataAlexander Okhotin. 243-258
- Intrinsically Universal Cellular AutomataNicolas Ollinger. 259-266
- A Particular Universal Cellular AutomatonNicolas Ollinger, Gaétan Richard. 267-278
- Self-Assembly of Infinite StructuresMatthew J. Patitz, Scott M. Summers. 279-292
- Computational Processes and IncompletenessKlaus Sutner. 293-304
- New Choice for Small Universal Devices: Symport/Antiport P SystemsSergey Verlan, Yurii Rogozhin. 305-314