Syndetics omslagsbild
Bild från Syndetics

Unconventional Models of Computation [electronic resource] : Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings / edited by Cristian Calude, Michael J. Dinneen, F. Peper.

Medverkande: Materialtyp: TextSerie: Utgivningsuppgift: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002Utgåva: 1st ed. 2002Beskrivning: IX, 329 p. online resourceInnehållstyp:
  • text
Medietyp:
  • computer
Bärartyp:
  • online resource
ISBN:
  • 9783540458333
Ämnen: DDK-klassifikation:
  • 004.0151 23
Onlineresurser:
Innehåll:
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 2Hardware-Free3 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.
Inga fysiska exemplar för denna post

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 2Hardware-Free3 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.

Licensed e-book