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