Calude / Casti / Dinneen | Unconventional Models of Computation | Buch | 978-981-3083-69-1 | sack.de

Buch, Englisch, 428 Seiten, Book, Format (B × H): 155 mm x 235 mm, Gewicht: 660 g

Reihe: Discrete Mathematics and Theoretical Computer Science

Calude / Casti / Dinneen

Unconventional Models of Computation


1998
ISBN: 978-981-3083-69-1
Verlag: Springer Singapore

Buch, Englisch, 428 Seiten, Book, Format (B × H): 155 mm x 235 mm, Gewicht: 660 g

Reihe: Discrete Mathematics and Theoretical Computer Science

ISBN: 978-981-3083-69-1
Verlag: Springer Singapore


Covering recent research into unconventional methods of computing for disciplines in computer science, mathematics, biology, physics and philosophy, the subjects include: nonconventional computational methods, DNA computation, quantum computation, and beyong Turing computability; new methods of discrete computation; theoretical and conceptual new computational paradigms; practical knowledge on new computing technologies.
Calude / Casti / Dinneen Unconventional Models of Computation jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Invited lectures and refereed research papers. Ausführliches Verzeichnis: Invited Papers: Marytyn Amos, Steve Wilson, David A. Hodgson, Gerald Owenson, and Alan Gibbons/ Practical Implementation of DNA Computations.- Artur Ekert and Chiara Macchiavello/An Overview of Quantum Computing.- H. Jeff Kimble/Implementing Quantum Logic and Communication via Cavity QED.- Seth Lloyd/Unconventional Quantum Computing Devices.- Cristopher Moore/Finite-Dimensional Analog Computers: Flows, Maps, and Recurrent Neural Networks.- John H.Reif/ Paradigms for Biomolecular Computation.- Arto Salomaa/Turning, Watson-Crick and Lindenmayer. Aspects of DNA Complementarity. Contributed papers: Gordon Alford/Explicitly Constructing Universal Extended H Systems.- Mark H. Butler, Ray C. Paton, and Paul H. Leng/ Unconventional Approaches for Biologically Inspired Computing.- Elena Calude and Marjo Lipponen/Deterministic Incomplete Automata: Simulation, Universality and Complementarity.- B.Jack Copeland/ Even Turing Machines Can Compute Uncomputable Functions.- Michael Frank, Tom Knight, and Norm Margolus/Reversibility in Optimally Scalable Computer Architectures.- Michael Frank, Carlin Vieri, M. Josephine Ammer, Nicole Love, Norman,Ö H. Margolus, and Thomas F. Knight, Jr./ A Scalable Reversible Computer in Silicon.- Rudolf Freund and Valeria Mihalache/Molecular Computations on Circular and Linear Strings.- Yuzhen Ge, Layne T.Watson, and Emmanuel G. Collins, Jr./ Genetic Algorithms for Optimization on a Quantum Computer.- Karl Gustafson/Ergodic Learning Algorithms.- Peter Hertling/Embedding Cellular Automata into Reversible Ones.- Thomas F. Knight, Jr. and Gerald Jay Sussman/Cellular Gate Technology.- Alexandru Mateescu/Splicing on Routes: a Framework of DNA Computation.- Hideaki Matsueda/Spatiotemporal Evolution of Quantum Entangled Pure States in Quantum Computing Solid Block Circuits.- Lakshmi Narayanaswamy and Peter M. Kogge/Combinators and Processing-In-Memory: An Unconventional Basis for Avoiding the Memory Wall.- Mitsunori Ogihara and Animeesh Ray/ The Minimum DNA Computation Model and Its Computational Power.- Gheorghe Paun/Distributed Architectures in DNA Computing Based on Splicing:Limiting the Size of Components.- Boris Pavlov, Gary Roach, and Adil Yafyasov/Resonance Scattering and Design of Quantum Gates.- Yuzuru Sato, Makoto Taiji, amd Takashi Ikegami/Self-Similar Sets as Satisfiable Boolean Expressions.- Karl Svozil/The Church-Turning Thesis as a Guiding Principle for Physics.- Carlin Vieri, M.Jopsehine Ammer, Amory Wakefield, Lars "Johnny" Svensson, William Athas, and Tom Knight/Designing Reversible Memory.- Herbert Wiklicky/Quantitative Computation by Hilbert Machines.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.