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 -

by Erwig, Martin

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

Description

The MIT Press. Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Ask the seller a question Add to wish list
A$16.31
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Ships from BooksRun (Pennsylvania, 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
  • Illustrated Yes
  • Features Bibliography, Glossary, Illustrated, Index
  • Bookseller's Inventory # 0262545292-8-1
  • 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 1

About BooksRun Pennsylvania, United States

Specialising in: Textbooks
Biblio member since 2016

BooksRun - best place to buy, sell or rent cheap textbooks

Terms of Sale:

30 days return guarantee. 10% restocking fee applies to discretionary returns

Browse books from BooksRun

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-