Información General

• Autores: UC 2005 Corporate Author, Cristian S. Calude (ed. lit.), Michael J. Dinneen (ed. lit.), Gheorghe Paun (ed. lit.) , Mario de Jesús Pérez Jiménez (ed. lit.) , Grzegorz Rozenberg (ed. lit.)
• Editores: Springer Berlin, Heidelberg
• Año de publicación: 2005
• País: España
• Idioma: inglés
• ISBN: 3-540-32022-9
• Recoge los contenidos presentados a: International Conference on Unconventional Computation and Natural Computation (4. 2005. Sevilla).
• Texto completo no disponible (Saber más ...)

Resumen

• 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.

Otros catálogos

• Red de Bibliotecas Universitarias (REBIUN)

Listado de artículos

• • Invited Papers

    • Seleccionado

      Using Genetic Algorithms to Evolve Behavior in Cellular Automata

      Thomas Bäck, Ron Breukelaar

      págs. 1-10

      
    • Seleccionado

      Quantum Searching Amidst Uncertainty

      Lov K. Grover

      págs. 11-18

      
    • Seleccionado

      Logic Functions of the Genomic Cis-regulatory Code

      Eric Davidson, Sorin Istrailt

      págs. 19-19

      
    • Seleccionado

      Structural DNA Nanotechnology: Molecular Construction and Computation

      Ruojie Sha, Xiaoping Zhang, Shiping Liao, Pamela E. Constantinou, Baoquan Ding, Tong Wang

      págs. 20-31

      
    • Seleccionado

      Natural Inspiration for Artificial Adaptivity: Some Neurocomputing Experiences in Robotics

      Carme Torras

      págs. 32-45

      

  • Regular Papers

    • Seleccionado

      On Self-assembly in Population P Systems

      Francesco Bernardini, Marian Gheorghe , Natalio Krasnogor , Jean-Louis Giavitto

      págs. 46-57

      
    • Seleccionado

      A Web-Based P Systems Simulator and Its Parallelization

      Cosmin Bonchis, Gabriel Ciobanu, Cornel Isbasa, Dana Petcu

      págs. 58-69

      
    • Seleccionado

      Communication Complexity as a Principle of Quantum Mechanics

      Adán Cabello Quintero

      págs. 70-81

      
    • Seleccionado

      On Model-Checking of P Systems

      Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie

      págs. 82-93

      
    • Seleccionado

      Looking for Simple Common Schemes to Design Recognizer P Systems with Active Membranes That Solve Numerical Decision Problems

      María del Carmen Graciani Díaz, Agustín Riscos Núñez

      págs. 94-104

      
    • Seleccionado

      P Systems with Active Membranes, Without Polarizations and Without Dissolution: A Characterization of P

      Miguel Ángel Gutiérrez Naranjo , Mario de Jesús Pérez Jiménez , Agustín Riscos Núñez , Francisco José Romero Campero

      págs. 105-116

      
    • Seleccionado

      Discrete State Transition Systems on Continuous Space-Time: A Theoretical Model for Amorphous Computing

      Masami Hagiya

      págs. 117-129

      
    • Seleccionado

      On Reversible Cellular Automata with Finite Cell Array

      Shuichi Inokuchi, Kazumasa Honda, Hyen Yeal Lee, Tatsuro Sato, Yoshihiro Mizoguchi, Yasuo Kawahara

      págs. 130-141

      
    • Seleccionado

      A Computational Model for Self-assembling Flexible Tiles

      Nataša Jonoska, Gregory L. McColm

      págs. 142-156

      
    • Seleccionado

      On Formulations of Firing Squad Synchronization Problems

      Kojiro Kobayashi, Darin Goldstein

      págs. 157-168

      
    • Seleccionado

      Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems

      Oleksiy Kurganskyy, Igor Potapov

      págs. 169-175

      
    • Seleccionado

      On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer

      Marius Nagy, Selim G. Akl

      págs. 176-190

      
    • Seleccionado

      On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata

      Predrag T. Tošić, Gul A. Agha

      págs. 191-205

      
    • Seleccionado

      A New Sibling of BQP

      Tereza Tušarová

      págs. 206-213

      
    • Seleccionado

      A Twelve-State Optimum-Time Synchronization Algorithm for Two-Dimensional Rectangular Cellular Arrays

      Hiroshi Umeo, Masaya Hisaoka, Shunsuke Akiguchi

      págs. 214-223

      
    • Seleccionado

      Computing by Self-reproduction: Autopoietic Automata

      Jirí Wiedermann

      págs. 224-236

      
    • Seleccionado

      Lower Bounds on the Computational Power of an Optical Model of Computation

      Damien Woods, J. Paul Gibson

      págs. 237-250

      
    • Seleccionado

      On Counterfactual Computation

      Paolo Zuliani

      págs. 251-266