000 05693nam a22005895i 4500
001 978-3-540-32022-7
003 DE-He213
005 20240423130249.0
007 cr nn 008mamaa
008 100316s2005 gw | s |||| 0|eng d
020 _a9783540320227
_9978-3-540-32022-7
024 7 _a10.1007/11560319
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aUnconventional Computation
_h[electronic resource] :
_b4th International Conference, UC 2005, Sevilla, Spain, October 3-7, Proceedings /
_cedited by Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Mario de Jesus Pérez-Jiménez, Grzegorz Rozenberg.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXI, 267 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3699
505 0 _aInvited 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.
520 _aThe 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.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aBioinformatics.
650 1 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aBioinformatics.
700 1 _aCalude, Cristian S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDinneen, Michael J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPaun, Gheorghe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPérez-Jiménez, Mario de Jesus.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRozenberg, Grzegorz.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540291008
776 0 8 _iPrinted edition:
_z9783540816096
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3699
856 4 0 _uhttps://doi.org/10.1007/11560319
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c186771
_d186771