Non-standard computation : molecular computation, cellular automata, evolutionary algorithms, quantum computers / Tino Gramss ... [et al.].
Contributor(s): Gramss, Tino
Language: English Publisher: Germany : Wiley‐VCH Verlag GmbH, c1998Description: 1 online resource (240 pages)Content type: text Media type: computer Carrier type: online resourceISBN: 9783527294275 ; 9783527602964 (ebook)Subject(s): Molecular computers | Cellular automata | Evolutionary programming (Computer science) | Quantum computersGenre/Form: Electronic books.DDC classification: 511.3 LOC classification: QA76.887 | .N66 1998Online resources: Full text available at Wiley Online Library Click here to viewItem type | Current location | Home library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
COLLEGE LIBRARY | COLLEGE LIBRARY LIC Gateway | 511.3 N7301 1998 (Browse shelf) | Available | CL-50543 |
ABOUT THE AUTHOR
Tino Gramß and Stefan Bornholdt are the authors of Non-Standard Computation: Molecular Computation, Cellular Automata, Evolutionary Algorithms, Quantum Computers, published by Wiley.
Includes bibliographical references.
MOLECULAR COMPUTATION
Computational Molecules in the Cell
Artifical Biomolecular Systems
Supramolecular Systems
Future Prospects
Glossary of Biological, Biochemical, Chemical Terminology Used
GENETIC ALGORITHMS
Introduction
An Example: A Perfect Lens from Evolution
How Does It Really Work? Tricks and Variations
Applications of Genetic Algorithms
Model Inversion as a Hard Optimization Problem
Models of Genetic Algorithms
What next?
COMPUTATION IN CELLULAR AUTOMATA: A SELECTED REVIEW
Introduction
Von Neumann's Self-Reproducing Cellular Automaton
Universal Computation in Cellular Automata
Dynamics and Computation in Cellular Automata
The Firing Squad Synchronization Problem
Parallel Formal-Language Recognition by Cellular Automata
Parallel Arithmetic by Cellular Automata
Evolving Cellular Automata with Genetic Algorithms
Conclusion
INTRODUCTION TO THE THEORY OF QUANTUM COMPUTATION
Introduction: A Short History of Quantum Computation
Quantum Computers: A Simple Example
A Classical, Reversible Turing Machine
Quantum Turing Machines
Quantum Parallelism
Quantum-Mechanical, Locally Connected Computing Systems
Feynman's Serial Computer
Margolus Cellular Automaton
Realizing Quantum Computers
Universal Quantum Turing Machines with Local Hamiltonians
Parallelizability
Undecidability
Summary
QUANTUM COMPUTERS: FIRST STEPS TOWARDS A REALIZATION
Introduction
Basic Building Blocks
Experimental Approaches
The Ion Trap QC
Flying Qubits: Atoms
A Cavity Quantum Electrodynamics QC
Flying Qubits: Photons
Quantum Error Correction
Conclusion and Outlook
Appendix: Mathematical Formalism
In recent years, a discussion of fundamentally new computer concepts has been stirred up by new developments in various scientific areas. Even in the newspapers one could find articles containing evocative terms like 'Quantum Computers' or 'Molecular Computers'.
The background is the need for better performing computers in applications which require an extremely high parallelism or a special behaviour such as the simulation of quantum systems. Examples include the design of a turbine with about 100 parts, a realistic simulation of for instance only 40 electrons in a solid, and the search for the shortest telephone line that connects 100 cities scattered over a country. These require calculations that is far beyond the power of conventional computers!
This exciting book provides the first overview of and introduction to the chemical, biological and physical non-standard computation concepts which promise to solve these problems by a massive parallelism and a clever use of other effects: Molecular and Quantum Computers, and Genetic Algorithms.
Written on a scientific level, it is an up-to-date information source for scientists and graduate students working in the field in physics, chemistry, computer and life sciences as well as interested readers with a scientific background.
There are no comments for this item.