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
Stock photo: cover may vary

Once Upon an Algorithm: How Stories Explain Computing Paperback - 2022

by Erwig, Martin

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

Description

The MIT Press, 2022-08-09. paperback. Very Good. 7x0x9. Listing is for the book only. Book is in Very Good Condition. Covers and pages are clean with minimal wear. No markings or highlights within. Supplemental materials and access codes are not included.
Ask the seller a question Add to wish list
A$31.67
A$7.18 Delivery within USA
Standard delivery: 2 to 8 days
More delivery options
Ships from Readventuremedia (Florida, United States)

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 The MIT Press
  • Publication date 2022-08-09
  • Illustrated Yes
  • Features Bibliography, Glossary, Illustrated, Index
  • Bookseller's Inventory # A2B27S2-13377
  • 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)
  • Size 7x0x9
  • 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 1

About Readventuremedia Florida, United States

Biblio member since 2025

Welcome to Readventuremedia! We specialize in offering a carefully selected collection of books, including rare finds, and well-loved favorites. Whether you're searching for a literary classic, a scholarly reference, or a hidden gem, our goal is to connect you with the perfect book.

We take pride in providing accurate descriptions, quality packaging, and prompt shipping, ensuring a smooth and enjoyable buying experience. Supporting independent booksellers and book lovers is at the heart of what we do, and we're thrilled to share our passion for books with readers around the world.

Explore our collection — your next favorite book might be just a click away!

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Readventuremedia

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-