Algorithmic Adventures From Knowledge to Magic /

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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Hromkovic, Juraj (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03944nam a22005295i 4500
001 978-3-540-85986-4
003 DE-He213
005 20151204163005.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783540859864  |9 978-3-540-85986-4 
024 7 |a 10.1007/978-3-540-85986-4  |2 doi 
040 |d GrThAP 
050 4 |a QA76.758 
072 7 |a UMZ  |2 bicssc 
072 7 |a UL  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
100 1 |a Hromkovic, Juraj.  |e author. 
245 1 0 |a Algorithmic Adventures  |h [electronic resource] :  |b From Knowledge to Magic /  |c by Juraj Hromkovic. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2009. 
300 |a XIII, 363 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Education  |x Data processing. 
650 0 |a Popular works. 
650 1 4 |a Computer Science. 
650 2 4 |a Software Engineering/Programming and Operating Systems. 
650 2 4 |a Computers and Education. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Popular Science, general. 
650 2 4 |a Computing Methodologies. 
650 2 4 |a Theory of Computation. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540859857 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-85986-4  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)