Prime Day

Como cliente Amazon Prime obtén 3 meses de Audible gratis

Diseño de la portada del título Once Upon an Algorithm

Once Upon an Algorithm

How Stories Explain Computing

Muestra
Ahorros de temporada
0,99 € al mes durante los primeros 3 meses
Comenzar mi suscripción
Oferta válida hasta el 28 de diciembre de 2026.
Ahorra más del 90% en tus primeros 3 meses.
Escucha todo lo que quieras de entre miles de audiolibros y Originals incluidos.
Descarga tu audiolibro y escucha offline, sin interrupciones
Se renueva automáticamente por 9,99 €/mes después de 3 meses. Cancela mensualmente. La oferta termina el 28 de diciembre de 2026.

Once Upon an Algorithm

De: Martin Erwig
Narrado por: Walter Dixon
Comenzar mi suscripción

Se renueva automáticamente por 9,99 €/mes después de 3 meses. Cancela mensualmente. La oferta termina el 28 de diciembre de 2026.

Compra ahora por 17,00 €

Compra ahora por 17,00 €

Ahorros de temporada | 0,99 € al mes durante los primeros 3 meses

9,99 €/mes después. Se aplican condiciones. Cancela mensualmente.
Acerca de este título

How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts 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.

©2017 Massachusetts Institute of Technology (P)2018 Tantor
Psicología y salud mental
adbl_web_anon_alc_button_suppression_t1
No hay reseñas aún