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 Hardback - 2017

by Erwig, Martin

Add to wish list
  • Used
Used - Very good

Description

MIT Press. Used - Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Ask the seller a question Add to wish list
A$11.60
Free Delivery within USA
Standard delivery: 4 to 8 days
More delivery options
Ships from Better World Books (Indiana, United States)

Details

  • Title Once upon an Algorithm : How Stories Explain Computing
  • Author Erwig, Martin
  • Binding Hardback
  • Edition Hardback
  • Condition Used - Very good
  • Pages 336
  • Volumes 1
  • Language ENG
  • Publisher MIT Press
  • Publication date 2017-08
  • Bookseller's Inventory # 39275230-6
  • ISBN 9780262036634 / 0262036630
  • Weight 1.55 lbs (0.70 kg)
  • Dimensions 9.25 x 7.31 x 0.93 in (23.50 x 18.57 x 2.36 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 1

About Better World Books Indiana, United States

Biblio member since 2005

Better World Books is a for-profit, socially conscious business and a global online bookseller that collects and sells new and used books online, matching each purchase with a book donation. Each sale generates funds for literacy and education initiatives in the U.S., the UK, and around the world. Since its launch in 2003, Better World Books has raised over $35 million for libraries and literacy, donated over 38 million books, and reused or recycled more than 475 million books.

Terms of Sale: Better World Books ("BWB") values your satisfaction and offers you returns within thirty (30) days after the estimated delivery date on most items. All returned items must be in the original condition; used items should include the SKU sticker located on the spine or back of the product. If you have an incomplete, incorrect, or damaged shipment, please contact our Customer Care team via Biblio's contact seller options before proceeding with the return. Please keep in mind that because we deal mostly in used books, any extra components, such as CDs, DVDs, figurines, or access codes are not included.

Browse books from Better World Books

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.

tracking-