2009

Algorithmic Adventures

From Knowledge to Magic

Authors:

ISBN: 978-3-540-85985-7 (Print) 978-3-540-85986-4 (Online)

Table of contents (12 chapters)

  1. Front Matter

    Pages I-XIII

  2. No Access

    Book Chapter

    Pages 1-35

    A Short Story About the Development of Computer Science or Why Computer Science Is Not a Computer Driving Licence

  3. No Access

    Book Chapter

    Pages 37-71

    Algorithmics, or What Have Programming and Baking in Common?

  4. No Access

    Book Chapter

    Pages 73-116

    Infinity Is Not Equal to Infinity, or Why Infinity Is Infinitely Important in Computer Science

  5. No Access

    Book Chapter

    Pages 117-159

    Limits of Computability or Why Do There Exist Tasks That Cannot Be Solved Automatically by Computers

  6. No Access

    Book Chapter

    Pages 161-199

    Complexity Theory or What to Do When the Energy of the Universe Doesn’t Suffice for Performing a Computation?

  7. No Access

    Book Chapter

    Pages 201-237

    Randomness in Nature and as a Source of Efficiency in Algorithmics

  8. No Access

    Book Chapter

    Pages 239-275

    Cryptography, or How to Transform Drawbacks into Advantages

  9. No Access

    Book Chapter

    Pages 277-298

    Computing with DNA Molecules, or Biological Computer Technology on the Horizon

  10. No Access

    Book Chapter

    Pages 299-324

    Quantum Computers, or Computing in the Wonderland of Particles

  11. No Access

    Book Chapter

    Pages 325-358

    How to Make Good Decisions for an Unknown Future or How to Foil an Adversary

  12. Back Matter

    Pages 359-363