Unconventional Models of Computation
Editat de Cristian Calude, Michael J. Dinneen, F. Peperen Limba Engleză Paperback – 30 sep 2002
Preț: 323.41 lei
Preț vechi: 404.26 lei
-20% Nou
Puncte Express: 485
Preț estimativ în valută:
57.23€ • 66.74$ • 50.25£
57.23€ • 66.74$ • 50.25£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540443117
ISBN-10: 3540443118
Pagini: 344
Ilustrații: IX, 329 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540443118
Pagini: 344
Ilustrații: IX, 329 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- The Complexity of Real Recursive Functions.- Hypercomputation in the Chinese Room.- Very Large Scale Spatial Computing.- The Minimum-Model DNA Computation on a Sequence of Probe Arrays.- An Information Theoretic Approach to the Study of Genome Sequences: An Application to the Evolution of HIV.- Halting of Quantum Turing Machines.- Filtrons of Automata.- A Man and His Computer: An Issue of Adaptive Fitness and Personal Satisfaction.- Contributed Papers.- Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations.- Implementing Bead-Sort with P Systems.- Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment.- Data Structure as Topological Spaces.- The Blob: A Basic Topological Concept for “Hardware-Free” Distributed Computation.- Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata.- Generation of Diophantine Sets by Computing P Systems with External Output.- An Analysis of Computational Efficiency of DNA Computing.- Communication and Computation by Quantum Games.- On the Power of Tissue P Systems Working in the Minimal Mode.- Reversible Computation in Asynchronous Cellular Automata.- General-Purpose Parallel Simulator for Quantum Computing.- Towards Additivity of Entanglement of Formation.- Membrane Computing: When Communication Is Enough.- Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata.- Relativistic Computers and Non-uniform Complexity Theory.- Quantum Optimization Problems.- An Analysis of Absorbing Times of Quantum Walks.
Caracteristici
Includes supplementary material: sn.pub/extras