Hallo! Tracked shipping to Netherlands with Delivery Duty Paid for just €7 

Ship to
Netherlands
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Select your country

Americas

Europe

Rest of the world

portada Once Upon an Algorithm: How Stories Explain Computing
Type
Physical Book
Publisher
Year
2022
Language
English
Pages
332
Format
Paperback
Dimensions
22.6x17.8x2 cm
Weight
0.61 kg.
ISBN13
9780262545297

Once Upon an Algorithm: How Stories Explain Computing

Martin Erwig (Author) · MIT Press · Paperback

Once Upon an Algorithm: How Stories Explain Computing - Erwig, Martin

Cheaper New Book Imported to Netherlands
Delivery: 02 Oct - 06 Oct Shipping: 18 to 19 business days.
€ 21,15
Faster New Book Imported to Netherlands
Delivery: 10 Sep - 14 Sep Shipping: 2 to 3 business days.
€ 28,03
Import costs and 9% BTW included in the price ✅
€ 21,15

Synopsis "Once Upon an Algorithm: How Stories Explain Computing "

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.

Customers reviews

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews