Computing with cells and atoms : an introduction to quantum, DNA and membrane computing
著者
書誌事項
Computing with cells and atoms : an introduction to quantum, DNA and membrane computing
Taylor & Francis, 2001
- : pbk
大学図書館所蔵 全14件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
At the turning of the millennium, a switch in computing technology is forecasted and looked for. Two main directions of research, both based on quite unconventional ideas are most promising - quantum computing and molecular computing. In the last few years, both of these methods have been intensely investigated. The present book is the first "friendly" presentation of basic ideas in these exciting areas. The style is rigorous, but without entering into excessive technicalities. Equal attention is paid to the main practical results reported so far and the main theoretical developments. The book is written for the educated layman and is self-contained, including all the necessary facts from mathematics, computer science, biology and quantum mechanics.
目次
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 1.10. Bibliographic Notes 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 2.12 Bibliographic Notes 3. Membrane Computing 3.1 P Systems with Labeled Membranes 3.2. Examples 3.3. The Power of P Systems 3.4. Decidability Results 3.5. Rewriting P Systms 3.6. P Systems with Polarized Membranes 3.7. Normal Forms 3.8. P Systems on Asymmetric Graphs 3.9. P Systems with Active Membranes 3.10. Splicing P Systems 3.11 Variants, Problems, Conjectures 3.12 Bibliographic Notes 4. Quantum Computing 4.1. Church-Turing Thesis 4.2 Computation is Physical 4.3. Reversible Computation 4.4. The Copy Computer 4.5. Maxwell's Demon 4.6. Quantum World 4.7 Bits and Quibits 4.8. Quantum Calculus 4.9. Quibit Evolution 4.10 No Cloning Theorem 4.11. Measurements 4.12 Zeno Machines 4.13 Inexhaustible Uncertainty 4.14. Randomness 4.15. The EPR Conundrum and Bell's Theorem 4.16. Quantum Logic 4.17. Have Quantum Propositions Classical Meaning? 4.18 Quantum Computers 4.19 Quantum Algorithms 4.20 Quantum Complexity 4.21 Quantum Cryptography 4.22 Information and Teleportation 4.23 Computing the Uncomputable 4.24 Bibliographic Notes 5. Final Remarks 6. Bibliography 7. Index
「Nielsen BookData」 より