Normal view MARC view ISBD view

Algorithmic Adventures [electronic resource] :From Knowledge to Magic / by Juraj Hromkovic.

by Hromkovic, Juraj [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.Description: online resource.ISBN: 9783540859864.Subject(s): Computer science | Information theory | Computer software | Electronic data processing | Education | Mathematics | Computer Science | Computers and Education | Popular Science in Mathematics/Computer Science/Natural Science/Technology | Algorithm Analysis and Problem Complexity | Computing Methodologies | Theory of ComputationOnline resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: There is a considerable, satisfying and underappreciated depth in the science of computing, it offers so much more than simply a driving licence for using a computer. The author of this book is a top researcher working on the fundamentals of informatics, and he has considerable experience teaching complex subjects in a simple manner. In this book he invites the reader to explore the science of computing, convinced that a good explanation of even the most basic techniques can demonstrate the power and magic of the underlying principles. The author starts with the development of computer science, algorithms and programming, and then explains and shows how to exploit the concepts of infinity, computability, computational complexity, nondeterminism and randomness. Finally, he offers some insight into emerging computing paradigms such as biological computing and quantum computing. This book is a fascinating read for students of all levels, and for those curious to learn about the science and magic of algorithmics and its role in other scientific disciplines.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)

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.

There is a considerable, satisfying and underappreciated depth in the science of computing, it offers so much more than simply a driving licence for using a computer. The author of this book is a top researcher working on the fundamentals of informatics, and he has considerable experience teaching complex subjects in a simple manner. In this book he invites the reader to explore the science of computing, convinced that a good explanation of even the most basic techniques can demonstrate the power and magic of the underlying principles. The author starts with the development of computer science, algorithms and programming, and then explains and shows how to exploit the concepts of infinity, computability, computational complexity, nondeterminism and randomness. Finally, he offers some insight into emerging computing paradigms such as biological computing and quantum computing. This book is a fascinating read for students of all levels, and for those curious to learn about the science and magic of algorithmics and its role in other scientific disciplines.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha