Algorithmic Adventures: From Knowledge to Magic [Hardcover]

Juraj Hromkovic (Author)

Book Description

ISBN-10: 3540859853 | ISBN-13: 978-3540859857 | Publication Date: July 8, 2009 | Edition: 1

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.

Editorial Reviews

Review

From the reviews: "A lucid exposition of fundamental ideas, concepts and methods of computer science, their essence and their limits, delightfully represented, and easily understandable for a broad readership. Scientific writing at its best." (Peter Widmayer, ETH Zürich) “This book originated from a series of lectures given by the author to describe what computer science is and what its principle Ideas are. Algorithms are the key concept of this book. … The inclusion of problems makes the book more than a personal reflection. The style is lively and avoids unnecessary jargon. With a good teacher, it could be suitable as a textbook on the foundations of computer science in an undergraduate classroom.” (Anthony J. Duben, ACM Computing Reviews, February, 2010) “This is a very readable book on theoretical computer science, written for nonspecialists. … Practical applications are illustrated by examples from DNA computing and quantum mechanics. … Summing Up: Recommended. Lower- and upper-division undergraduates and general readers.” (M. Bona, Choice, Vol. 47 (5), January, 2010) “The author is an acclaimed computer scientist and he proves why: apart from being an aggressive researcher, he is also an excellent teacher. Using his ability to teach complex computing topics in an interesting way, he introduces to the reader the ‘power and the magic’ of the underlying principles. … It will certainly draw interest from both undergraduate and post-graduate students of computing and allied fields. … I do recommend this beautiful book for a scientific library … .” (Soubhik Chakraborty, ACM Computing Reviews, August, 2010)

Product Details

• Hardcover: 376 pages
• Publisher: Springer; 1 edition (July 8, 2009)
• Language: English
• ISBN-10: 3540859853
• ISBN-13: 978-3540859857
• Product Dimensions: 9.4 x 6.3 x 1 inches
• Shipping Weight: 1.3 pounds (View shipping rates and policies)
• Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon Best Sellers Rank: #530,796 in Books (See Top 100 in Books)
  • #89 in Books > Computers & Technology > Programming > Algorithms > Cryptography

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

8 of 8 people found the following review helpful:

5.0 out of 5 stars Brilliant Introduction to Essence of Computer Science, August 8, 2009

By 

Edmon Begoli (Knoxville, TN United States) - See all my reviews
(REAL NAME)   

This review is from: Algorithmic Adventures: From Knowledge to Magic (Hardcover)

Subjects from the theoretical computer science can often be very difficult to grasp.
Yet, their importance and the presence in everyday, technology interwoven, life cannot be overstated.

Complexity, computability, algorithms are foundations beneath everyday programming, inter-networking, security, data processing.

This is a brilliant book that only true master of the subject
can produce, but that all in both computer science and IT can appreciate.

In this book, Dr. Hromkovic with ease and in a very readable, understandable terms, explains some of the most challenging subjects from the theory of computation - algorithms, countable vs. uncountable infinity, complexity, computability, decidability, cryptography, quantum computing.

Dr. Hromkovic starts his explanations in a very simple, approachable, readable way, and he slowly and steadily leads the reader towards the level of deep qualitative understanding. His language always
reminds accessible even when he is deep into a real of theory and complex matters.

I found this book as I was looking for a gentle, readable introduction
into a complex subject. I am a PhD student in Computer Science
whose background was more on an engineering and less on a theoretical side.

I academically needed this material, but I also sought it as I developed the love for the subject.

This book was a perfect find for all my academic and intellectual needs.

1 of 1 people found the following review helpful:

5.0 out of 5 stars Wonderful book - discussing the basics as well as the advanced Algorithms used, May 20, 2011

By 

Sumit Pal (Boston, MA United States) - See all my reviews
(REAL NAME)   

Amazon Verified Purchase

This review is from: Algorithmic Adventures: From Knowledge to Magic (Hardcover)

This is not a typical Algorithm book - it is more a book - that describes the current state of Algorithms - how they are used in different things and in nature.

This is a very good book that takes you from simplistic algorithmic concepts to the deep descriptions of how Algorithms are part of everything in this universe - to the open nature of algorithms as to what they can do - and what are the possibilities of Algorithms and where they can be applied.

Reading / the book was a real pleasure - though since I come from a Computer Science Background - the first few chapters were - just basics for me.

The author has a good writing style and examples are perfectly used to explain the concepts and ideas and thoughts.

This book is more of a fun reading and at the same time very revealing on the capabilities of Algorithms.