Unconventional Computation 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, Proceedings /
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 Sevill...
Clasificación: | Libro Electrónico |
---|---|
Autor Corporativo: | |
Otros Autores: | , , , , |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2005.
|
Edición: | 1st ed. 2005. |
Colección: | Theoretical Computer Science and General Issues,
3699 |
Temas: | |
Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- 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.