Front matter
1-14
The Complexity of Real Recursive Functions
Manuel Lameiras Campagnolo
15-26
Hypercomputation in the Chinese Room
B. Jack Copeland
27-37
Very Large Scale Spatial Computing
André DeHon
38-49
The Minimum-Model DNA Computation on a Sequence of Probe Arrays
Mitsunori Ogihara and Animesh Ray
50-57
An Information Theoretic Approach to the Study of Genome Sequences: An Application to the Evolution of HIV
Masanori Ohya
58-65
Halting of Quantum Turing Machines
Masanao Ozawa
66-85
Filtrons of Automata
Paweł Siwak
86-99
A Man and His Computer: An Issue of Adaptive Fitness and Personal Satisfaction
Tommaso Toffoli
100-114
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations
Masami Amano, Kazuo Iwama and Rudy Raymond
115-125
Implementing Bead-Sort with P Systems
Joshua J. Arulanandham
126-136
Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment
C. Graciani Díaz, F. J. Martín Mateos and Mario J. Pérez Jiménez
137-150
Data Structure as Topological Spaces
Jean-Louis Giavitto and Olivier Michel
151-163
The Blob: A Basic Topological Concept for “Hardware-Free” Distributed Computation
Frédéric Gruau and Philippe Malbos
164-175
Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata
Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto and Kenichi Morita
176-190
Generation of Diophantine Sets by Computing P Systems with External Output
Álvaro Romero Jiménez and Mario J. Pérez Jiménez
191-198
An Analysis of Computational Efficiency of DNA Computing
Atsushi Kameda, Nobuo Matsuura, Masahito Yamamoto and Azuma Ohuchi
199-207
Communication and Computation by Quantum Games
Takeshi Kawakami
208-219
On the Power of Tissue P Systems Working in the Minimal Mode
Shankara Narayanan Krishna and Raghavan Rama
220-229
Reversible Computation in Asynchronous Cellular Automata
Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita and Shinro Mashiko
230-251
General-Purpose Parallel Simulator for Quantum Computing
Jumpei Niwa, Keiji Matsumoto and Hiroshi Imai
252-263
Towards Additivity of Entanglement of Formation
Toshiyuki Shimono
264-275
Membrane Computing: When Communication Is Enough
Petr Sosík and Jiří Matýsek
276-286
Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata
Hiroshi Umeo, Masaya Hisaoka, Koshi Michisaka, Koji Nishioka and Masashi Maeda
287-299
Relativistic Computers and Non-uniform Complexity Theory
Jiří Wiedermann and Jan van Leeuwen
300-314
Quantum Optimization Problems
Extended Abstract
Tomoyuki Yamakami
315-329
An Analysis of Absorbing Times of Quantum Walks
Tomohiro Yamasaki, Hirotada Kobayashi and Hiroshi Imai
Back matter