Abstract is missing.
- Algorithmic Randomness, Quantum Physics, and IncompletenessCristian Calude. 1-17 [doi]
- On the Complexity of Universal ProgramsAlain Colmerauer. 18-35 [doi]
- Finite Sets of Words and ComputingJuhani Karhumäki. 36-49 [doi]
- Universality and Cellular AutomataKlaus Sutner. 50-59 [doi]
- Leaf Language ClassesKlaus W. Wagner. 60-81 [doi]
- Computational Completeness of P Systems with Active Membranes and Two PolarizationsArtiom Alhazov, Rudolf Freund, Gheorghe Paun. 82-92 [doi]
- Computing with a Distributed Reaction-Diffusion ModelStefania Bandini, Giancarlo Mauri, Giulio Pavesi, Carla Simone. 93-103 [doi]
- Computational Universality in Symbolic Dynamical SystemsJean-Charles Delvenne, Petr Kurka, Vincent D. Blondel. 104-115 [doi]
- Real Recursive Functions and Real Extensions of Recursive FunctionsOlivier Bournez, Emmanuel Hainry. 116-127 [doi]
- Ordering and Convex PolyominoesGiusi Castiglione, Antonio Restivo. 128-139 [doi]
- Subshifts Behavior of Cellular Automata. Topological Properties and Related LanguagesGianpiero Cattaneo, Alberto Dennunzio. 140-152 [doi]
- Evolution and Observation: A Non-standard Way to Accept Formal LanguagesMatteo Cavaliere, Peter Leupold. 153-163 [doi]
- The Computational Power of Continuous Dynamic SystemsJerzy Mycka, José Félix Costa. 164-175 [doi]
- Abstract Geometrical Computation for Black Hole ComputationJérôme Durand-Lose. 176-187 [doi]
- Is Bosco s Rule Universal?Kellie Michele Evans. 188-199 [doi]
- Sequential P Systems with Unit Rules and Energy Assigned to MembranesRudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron. 200-210 [doi]
- Hierarchies of DLOGTIME-Uniform CircuitsChuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu. 211-222 [doi]
- Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular ArraysHiroshi Umeo, Masaya Hisaoka, Masato Teraoka, Masashi Maeda. 223-232 [doi]
- Register Complexity of LOOP-, WHILE-, and GOTO-ProgramsMarkus Holzer, Martin Kutrib. 233-244 [doi]
- Classification and Universality of Reversible Logic Elements with One-Bit MemoryKenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato. 245-256 [doi]
- Universal Families of Reversible P SystemsAlberto Leporati, Claudio Zandron, Giancarlo Mauri. 257-268 [doi]
- Solving 3CNF-SAT and HPP in Linear Time Using WWWFlorin Manea, Carlos Martín-Vide, Victor Mitrana. 269-280 [doi]
- Completing a Code in a Regular Submonoid of the Free MonoidJean Neraud. 281-291 [doi]
- On Computational Universality in Language EquationsAlexander Okhotin. 292-303 [doi]
- Attacking the Common Algorithmic Problem by Recognizer P SystemsMario J. Pérez-Jiménez, Francisco José Romero-Campero. 304-315 [doi]
- On the Minimal Automaton of the Shuffle of Words and AraucariasRené Schott, Jean-Claude Spehner. 316-327 [doi]