Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008632653/catalog> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- catalog contributor b12088963.
- catalog contributor b12088964.
- catalog created "c2001.".
- catalog date "2001".
- catalog date "c2001.".
- catalog dateCopyrighted "c2001.".
- catalog description "1. Prerequisites. 1.1. Preliminary Notions and Notations. 1.2. Operations on Strings and Languages. 1.3. A General Computing Framework. 1.4. Chomsky Grammars. 1.5. Lindenmayer Systems. 1.6. Automata and Transducers. 1.7. Characterizations of Computably Enumerable Languages. 1.8. Universal Turing Machines and Type-0 Grammars. 1.9. Complexity -- 2. DNA Computing. 2.1. The Structure of DNA. 2.2. Complementarity Induces Computational Completeness. 2.3. Operations on DNA Molecules. 2.4. Adleman's Experiment. 2.5. Other DNA Solutions to NP Complete Problems. 2.6. A Two-Dimensional Generalization. 2.7. Computing by Carving. 2.8. Sticker Systems. 2.9. Extended H Systems. 2.10. Controlled H Systems. 2.11. Distributed H Systems.".
- catalog description "Includes bibliographical references (p. 285-305) and index.".
- catalog extent "x, 309 p. :".
- catalog identifier "0748408991 (pbk. : alk. paper)".
- catalog issued "2001".
- catalog issued "c2001.".
- catalog language "eng".
- catalog publisher "London ; New York : Taylor & Francis,".
- catalog subject "004.1 21".
- catalog subject "Molecular computers.".
- catalog subject "QA76.889 .C35 2001".
- catalog subject "Quantum computers.".
- catalog tableOfContents "1. Prerequisites. 1.1. Preliminary Notions and Notations. 1.2. Operations on Strings and Languages. 1.3. A General Computing Framework. 1.4. Chomsky Grammars. 1.5. Lindenmayer Systems. 1.6. Automata and Transducers. 1.7. Characterizations of Computably Enumerable Languages. 1.8. Universal Turing Machines and Type-0 Grammars. 1.9. Complexity -- 2. DNA Computing. 2.1. The Structure of DNA. 2.2. Complementarity Induces Computational Completeness. 2.3. Operations on DNA Molecules. 2.4. Adleman's Experiment. 2.5. Other DNA Solutions to NP Complete Problems. 2.6. A Two-Dimensional Generalization. 2.7. Computing by Carving. 2.8. Sticker Systems. 2.9. Extended H Systems. 2.10. Controlled H Systems. 2.11. Distributed H Systems.".
- catalog title "Computing with cells and atoms : an introduction to quantum, DNA, and membrane computing / Cristian S. Calude, Gheorghe Paun.".
- catalog type "text".