Abstract is missing.
- Three Small Universal Turing MachinesClaudio Baiocchi. 1-10 [doi]
- Computation in Gene NetworksAsa Ben-Hur, Hava T. Siegelmann. 11-24 [doi]
- Power, Puzzles and Properties of EntanglementJozef Gruska, Hiroshi Imai. 25-68 [doi]
- Combinatorial and Computational Problems on Finite Sets of WordsJuhani Karhumäki. 69-81 [doi]
- Computing with Membranes (P Systems): Universality ResultsCarlos Martín-Vide, Gheorghe Paun. 82-101 [doi]
- A Simple Universal Logic Element and Cellular Automata for Reversible ComputingKenichi Morita. 102-113 [doi]
- Some Applications of the Decidability of DPDA s EquivalenceGéraud Sénizergues. 114-132 [doi]
- The Equivalence Problem for Computational Models: Decidable and Undecidable CasesVladimir A. Zakharov. 133-152 [doi]
- Two Normal Forms for Rewriting P SystemsClaudio Zandron, Claudio Ferretti, Giancarlo Mauri. 153-164 [doi]
- On a Conjecture of Kurka. A Turing Machine with No Periodic ConfigurationsVincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu. 165-176 [doi]
- On the Transition Graphs of Turing MachinesDidier Caucal. 177-189 [doi]
- JC-NetsGabriel Ciobanu, Mihai Rotaru. 190-201 [doi]
- Nonterminal Complexity of Programmed GrammarsHenning Fernau. 202-213 [doi]
- On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix GrammarsRudolf Freund, Gheorghe Paun. 214-225 [doi]
- A Direct Construction of a Universal Extended H SystemPierluigi Frisco. 226-239 [doi]
- Speeding-Up Cellular Automata by AlternationsChuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai. 240-251 [doi]
- Efficient Universal Pushdown Cellular Automata and Their Application to ComplexityMartin Kutrib. 252-263 [doi]
- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication ConstraintsSalvatore La Torre, Margherita Napoli, Mimmo Parente. 264-275 [doi]
- P Systems with Membrane Creation: Universality and EfficiencyMadhu Mutyam, Kamala Krithivasan. 276-287 [doi]
- On the Computational Power of a Continuous-Space Optical Model of ComputationThomas J. Naughton, Damien Woods. 288-299 [doi]
- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)Zenon Sadowski. 300-307 [doi]
- D0L System + Watson-Crick Complementarity = Universal ComputationPetr Sosík. 308-320 [doi]