Abstract is missing.
- Copying quantum computer makes NP-complete problems tractableMika Hirvensalo. 1-10
- On the Universality of Post and Splicing SystemsClaudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori. 12-28
- Nine Test Tubes Generate any ::::RE:::: LanguageClaudio Ferretti, Giancarlo Mauri, Claudio Zandron. 30-41
- The Generative Power of ::::d::::-Dimensional #-Context-Free Array GrammarsHenning Fernau, Rudolf Freund, Markus Holzer. 43-56
- Intractability of Decision Problems for Finite-Memory AutomataHiroshi Sakamoto, Daisuke Ikeda. 58-74
- More on Morphisms and Almost-PeriodicityArnaud Maes. 76-88
- A computation-universal two-dimensional 8-state triangular reversible cellular automatonKatsunobu Imai, Kenichi Morita. 90-99
- Real-time generation of primes by a one-dimensional cellular automaton with 9-statesIvan Korec. 101-116
- About the Universality of the Billiard ball modelJérôme Olivier Durand-Lose. 118-132
- The Turing Closure of an Archimedean FieldPaolo Boldi, Sebastiano Vigna. 134-150
- The Separation Theorem for the Relation Classes Associated to the Extended Grzegorczyk ClassesJean Sylvestre Gakwaya. 152-167
- On the Border of Universality and Non-Universality in Restricted High-Level Petri NetsUlrich Nitsche. 169-181
- Foldede and Immersed Cellular AutomataJacqueline Signorini, Patrick Greussay. 183-192
- Dynamical universal computation in excitable latticesAndrew Adamatzky. 194-213
- Recursive and Recursively Enumerable Closed Subsets of Euclidean SpaceVasco Brattka, Klaus Weihrauch. 215-234