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

by Martin Erwig

Add to wish list
  • Used
  • as new
  • Hardback
New

Description

MIT Press, 2017. Hardcover. As New. Disclaimer:An apparently unread copy in perfect condition. Dust cover is intact; pages are clean and are not marred by notes or folds of any kind. At ThriftBooks, our motto is: Read More, Spend Less.Dust jacket quality is not guaranteed.
Ask the seller a question Add to wish list
A$14.75
Free Delivery within USA
Standard delivery: 4 to 8 days
More delivery options
Ships from ThriftBooks (Washington, United States)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title Once upon an Algorithm : How Stories Explain Computing
  • Author Martin Erwig
  • Binding Hardback
  • Edition Hardback
  • Condition New
  • Pages 336
  • Volumes 1
  • Language ENG
  • Publisher MIT Press
  • Publication date 2017
  • Bookseller's Inventory # G0262036630I2N00
  • 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 2

About ThriftBooks Washington, United States

Biblio member since 2018

From the largest selection of used titles, we put quality, affordable books into the hands of readers

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 ThriftBooks

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

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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.

Please wait a moment while we load the requested page.

tracking-