Unconventional Computation

The Fourth International Conference on Unconventional Computation, UC 2005, organized under the auspices of EATCS by the Centre for Discrete Mathematics and Theoretical Computer Science and the Department of C- puter Science and Arti?cial Intelligence of the University of Seville, was held in Seville, October 3-7, 2005. Seville, one of the most beautiful cities in Spain, is at its best in October. An explosion of colour and contrast: ?amenco, bull?ghting, and a lively at- sphere in the streets due to the open and friendly nature of its people. The river Guadalquivir, the Cathedral and the Golden Tower are all places full of magic where the visitor can feel the spirit of a city which is eternally romantic. The series of International Conferences Unconventional Computation (UC),https://www.cs.auckland.ac.nz/CDMTCS/conferences/uc/isdevoted to all aspects of unconventional computation, theory as well as experiments and applications. Typical, but not exclusive, topics are: natural computing including quantum, cellular,molecular, neural and evolutionarycomputing; chaosand - namical systems based computing; and various proposals for computations that go beyond the Turing model. The ?rst venue of the Unconventional Computation Conference (formerly called Unconventional Models of Computation) was Auckland, New Zealand in 1998; subsequent sites of the conference were Brussels, Belgium in 2000 and Kobe, Japan in 2002. The titles of the proceedings volumes from past UC Conferences are as follows: 1. C.S. Calude, J. Casti, M.J. Dinneen (eds.). Unconventional Models of C- putation, Springer-Verlag, Singapore, 1998, viii + 426 pp. ISBN: 981-3083- 69-7.

Inhalt

Invited Papers.- Using Genetic Algorithms to Evolve Behavior in Cellular Automata.- Quantum Searching Amidst Uncertainty.- Logic Functions of the Genomic Cis-regulatory Code.- Structural DNA Nanotechnology: Molecular Construction and Computation.- Natural Inspiration for Artificial Adaptivity: Some Neurocomputing Experiences in Robotics.- Regular Papers.- On Self-assembly in Population P Systems.- A Web-Based P Systems Simulator and Its Parallelization.- Communication Complexity as a Principle of Quantum Mechanics.- On Model-Checking of P Systems.- Looking for Simple Common Schemes to Design Recognizer P Systems with Active Membranes That Solve Numerical Decision Problems.- P Systems with Active Membranes, Without Polarizations and Without Dissolution: A Characterization of P.- Discrete State Transition Systems on Continuous Space-Time: A Theoretical Model for Amorphous Computing.- On Reversible Cellular Automata with Finite Cell Array.- A Computational Model for Self-assembling Flexible Tiles.- On Formulations of Firing Squad Synchronization Problems.- Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems.- On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer.- On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata.- A New Sibling of BQP.- A Twelve-State Optimum-Time Synchronization Algorithm for Two-Dimensional Rectangular Cellular Arrays.- Computing by Self-reproduction: Autopoietic Automata.- Lower Bounds on the Computational Power of an Optical Model of Computation.- On Counterfactual Computation.