Algorithmic Adventures From Knowledge to Magic /

• Κύριος συγγραφέας: Hromkovic, Juraj (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Θέματα: Computer science.; Software engineering.; Computers.; Algorithms.; Education > Data processing.; Popular works.; Computer Science.; Software Engineering/Programming and Operating Systems.; Computers and Education.; Algorithm Analysis and Problem Complexity.; Popular Science, general.; Computing Methodologies.; Theory of Computation.

The ?rst and foremost goal of this lecture series was to show the beauty, depth and usefulness of the key ideas in computer science. While working on the lecture notes, we came to understand that one can recognize the true spirit of a scienti?c discipline only by viewing its contributions in the fra...

Πίνακας περιεχομένων:

• A Short Story About the Development of Computer Science or Why Computer Science Is Not a Computer Driving Licence
• Algorithmics, or What Have Programming and Baking in Common?
• Infinity Is Not Equal to Infinity, or Why Infinity Is Infinitely Important in Computer Science
• Limits of Computability or Why Do There Exist Tasks That Cannot Be Solved Automatically by Computers
• Complexity Theory or What to Do When the Energy of the Universe Doesn’t Suffice for Performing a Computation?
• Randomness in Nature and as a Source of Efficiency in Algorithmics
• Cryptography, or How to Transform Drawbacks into Advantages
• Computing with DNA Molecules, or Biological Computer Technology on the Horizon
• Quantum Computers, or Computing in the Wonderland of Particles
• How to Make Good Decisions for an Unknown Future or How to Foil an Adversary.