Unconventional Computation
Editat de Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Mario De Jesus Pérez-Jiménez, Grzegorz Rozenbergen Limba Engleză Paperback – 19 sep 2005
Preț: 321.36 lei
Preț vechi: 401.70 lei
-20%
Puncte Express: 482
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540291008
ISBN-10: 3540291008
Pagini: 284
Ilustrații: XI, 267 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540291008
Pagini: 284
Ilustrații: XI, 267 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.