Hromkovic Algorithmic Adventures

From Knowledge to Magic
1. Auflage 2009
ISBN: 978-3-540-85986-4
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 363 Seiten, Web PDF

Reihe: Computer Science (R0)

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 framework of science as a whole. We present computer science here as a fundamental science that, interacting with other scienti?c disciplines, changed and changes our view on the world, that contributes to our understanding of the fundamental concepts of science and that sheds new light on and brings new meaning to several of these concepts. We show that computer science is a discipline that discovers spectacular, unexpected facts, that ?nds ways out in seemingly unsolvable s- uations, and that can do true wonders. The message of this book is that computer science is a fascinating research area with a big impact on the real world, full of spectacular ideas and great ch- lenges. It is an integral part of science and engineering with an above-average dynamic over the last 30 years and a high degree of interdisciplinarity. The goal of this book is not typical for popular science writing, whichoftenrestrictsitselftooutliningtheimportanceofaresearch area. Whenever possible we strive to bring full understanding of the concepts and results presented.

Zielgruppe

Popular/general

Autoren/Hrsg.

Hromkovic, Juraj

Inhaltsverzeichnis

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.