BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Once Upon an Algorithm: How Stories Explain Computing

Once Upon an Algorithm: How Stories Explain Computing

Once Upon an Algorithm: How Stories Explain Computing Paperback -

by Erwig, Martin

Add to wish list
  • Used
  • very good
  • Paperback
Used - Very good

Description

Paperback. Very Good.
Ask the seller a question Add to wish list
A$53.44
A$16.47 Delivery to USA
Standard delivery: 7 to 40 days
More delivery options
Ships from World of Books Ltd (West Sussex, United Kingdom)

Details

  • Title Once Upon an Algorithm: How Stories Explain Computing
  • Author Erwig, Martin
  • Binding Paperback
  • Condition Used - Very good
  • Pages 332
  • Volumes 1
  • Language ENG
  • Publisher MIT Press
  • Illustrated Yes
  • Features Bibliography, Glossary, Illustrated, Index
  • Bookseller's Inventory # GOR013824769
  • ISBN 9780262545297 / 0262545292
  • Weight 1.35 lbs (0.61 kg)
  • Dimensions 8.9 x 7 x 0.8 in (22.61 x 17.78 x 2.03 cm)
  • Age range 18 to UP years
  • Grade levels 13 - UP
  • Category Mathematics
  • Library of Congress subjects Computer algorithms
  • Library of Congress Catalogue Number 2016053945
  • Dewey Decimal Code 005.1
  • Quantity available 2

About World of Books Ltd West Sussex, United Kingdom

Biblio member since 2007

In 2002, World of Books was founded on an ethos to do good, protect the planet, and support charities by enabling more goods to be reused. Since then, we've grown into a global pioneer, dedicated to helping people read more and waste less. Through the World of Books brand, customers can now buy and sell with us! We provide affordable, preloved books to book lovers all around the world, while also giving people the opportunity to contribute to the circular economy, earn money and protect the planet by trading in their unwanted books and media for cash. Through the B2B side of our business we've developed technology to help charities sell in bulk, meaning they can clear much needed floor space and make money for great causes at the same time. A new book will be sold once but their stories can be enjoyed by more than one owner. After all, a story doesn't change because it's been read before!

Terms of Sale:

If you are not completely satisfied with your purchase for any reason, simply email customerservice@worldofbooks.com and we will quickly resolve any issues you may have. If you have any other queries about your order, please email customerservice@worldofbooks.com. Our goal is to deliver to our customers the best possible service and we hope your experience of dealing with us lives up to our promise. If for whatever reason we fail to meet your expectations then please let us know.

Browse books from World of Books Ltd

Reader reviews for Once Upon an Algorithm: How Stories Explain Computing

From the publisher

This easy-to-follow introduction to computer science reveals how familiar stories like Hansel and Gretel, Sherlock Holmes, and Harry Potter illustrate the concepts and everyday relevance of computing.

Picture a computer scientist, staring at a screen and clicking away frantically on a keyboard, hacking into a system, or perhaps developing an app. Now delete that picture. In Once Upon an Algorithm, Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study of systematic problem solving. Erwig points out that many daily activities involve problem solving. Getting up in the morning, for example: You get up, take a shower, get dressed, eat breakfast. This simple daily routine solves a recurring problem through a series of well-defined steps. In computer science, such a routine is called an algorithm.

Erwig illustrates a series of concepts in computing with examples from daily life and familiar stories. Hansel and Gretel, for example, execute an algorithm to get home from the forest. The movie Groundhog Day illustrates the problem of unsolvability; Sherlock Holmes manipulates data structures when solving a crime; the magic in Harry Potter's world is understood through types and abstraction; and Indiana Jones demonstrates the complexity of searching. Along the way, Erwig also discusses representations and different ways to organize data; "intractable" problems; language, syntax, and ambiguity; control structures, loops, and the halting problem; different forms of recursion; and rules for finding errors in algorithms.

This engaging book explains computation accessibly and shows its relevance to daily life. Something to think about next time we execute the algorithm of getting up in the morning.

About the author

Martin Erwig is Professor of Computer Science in the School of Electrical Engineering and Computer Science at Oregon State University.
tracking-