Invited Speakers
Andrew
ADAMATZKY, University of Bristol, UK
Encapsulating Reaction-diffusion Computers
Olivier
BOURNEZ, LORIA, INRIA-Lorraine, France
On the Computational Capabilities of Several Analog Models
Mark
BURGIN, University of Califonia at Los Angeles, USA
Universality, Reducibility, and Completeness
Manuel
CAMPAGNOLO, Lisbon University of Technology, Portugal
Using Approximation to Relate Computational Classes over the
Reals
Joel David
HAMKINS, The City University of New York, USA
A Survey of Infinite Time Turing Machines
Jarkko
KARI, University of Turku, Finland
The Tiling Problem Revisited
Pascal
KOIRAN, École Normale Supérieure de Lyon,
France
Decision versus Evaluation in Algebraic Complexity
Kenichi
MORITA, University of Hiroshima, Japan
A Universal Reversible Turing machine
Kumbakonamgovindarajan SUBRAMANIAN, Christian College of Chennai, India
P Systems and Picture Languages CANCELED
Klaus
SUTNER, Carnegie Mellon University, Pittsburgh, USA
Information Hiding and Incompleteness