Abstract is missing.
- Encapsulating Reaction-Diffusion ComputersAndrew Adamatzky. 1-11 [doi]
- On the Computational Capabilities of Several ModelsOlivier Bournez, Emmanuel Hainry. 12-23 [doi]
- Universality, Reducibility, and CompletenessMark Burgin. 24-38 [doi]
- Using Approximation to Relate Computational Classes over the RealsManuel Lameiras Campagnolo, Kerry Ojakian. 39-61 [doi]
- A Survey of Infinite Time Turing MachinesJoel David Hamkins. 62-71 [doi]
- The Tiling Problem Revisited (Extended Abstract)Jarkko Kari. 72-79 [doi]
- Decision Versus Evaluation in Algebraic ComplexityPascal Koiran. 80-89 [doi]
- A Universal Reversible Turing MachineKenichi Morita, Yoshikazu Yamaguchi. 90-98 [doi]
- P Systems and Picture LanguagesK. G. Subramanian. 99-109 [doi]
- Partial Halting in P Systems Using Membrane Rules with Permitting ContextsArtiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan. 110-121 [doi]
- Uniform Solution ofArtiom Alhazov, Mario J. Pérez-Jiménez. 122-133 [doi]
- Satisfiability Parsimoniously Reduces to the Tantrix:::TM::: Rotation Puzzle ProblemDorothea Baumeister, Jörg Rothe. 134-145 [doi]
- Planar Trivalent Network ComputationTommaso Bolognesi. 146-157 [doi]
- On the Power of Networks of Evolutionary ProcessorsJürgen Dassow, Bianca Truthe. 158-169 [doi]
- Study of Limits of Solvability in Tag SystemsLiesbeth De Mol. 170-181 [doi]
- Query Completeness of Skolem Machine ComputationsJohn Fisher, Marc Bezem. 182-192 [doi]
- More on the Size of Higman-Haines Sets: Effective ConstructionsHermann Gruber, Markus Holzer, Martin Kutrib. 193-204 [doi]
- Insertion-Deletion Systems with One-Sided ContextsArtiom Matveevici, Yurii Rogozhin, Sergey Verlan. 205-217 [doi]
- Accepting Networks of Splicing Processors with Filtered ConnectionsJuan Castellanos, Florin Manea, Luis Fernando de Mingo López, Victor Mitrana. 218-229 [doi]
- Hierarchical Relaxations of the Correctness Preserving Property for Restarting AutomataFrantisek Mráz, Friedrich Otto, Martin Plátek. 230-241 [doi]
- Four Small Universal Turing MachinesTurlough Neary, Damien Woods. 242-254 [doi]
- Changing the Neighborhood of Cellular AutomataHidenosuke Nishio. 255-266 [doi]
- A Simple P-Complete Problem and Its Representations by Language EquationsAlexander Okhotin. 267-278 [doi]
- Slightly Beyond Turing s Computability for Studying Genetic ProgrammingOlivier Teytaud. 279-290 [doi]
- A Smallest Five-State Solution to the Firing Squad Synchronization ProblemHiroshi Umeo, Takashi Yanagihara. 291-302 [doi]
- Small Semi-weakly Universal Turing MachinesDamien Woods, Turlough Neary. 303-315 [doi]
- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4::::n::::-Steps SolutionJean-Baptiste Yunès. 316-324 [doi]