- Di
- Con:
- Editore:

- 17 Valutazioni
3.3

- Durata
- 10h 48min
- Lingua
- Inglese
- Format
- Categoria
Non-fiction

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.

© 2018 Tantor Media, Inc. (Audiolibro): 9781977383549

Data di uscita

Audiolibro: 12 giugno 2018

Tag

- Di
- Con:
- Editore:

- 17 Valutazioni
3.3

- Durata
- 10h 48min
- Lingua
- Inglese
- Format
- Categoria
Non-fiction

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.

© 2018 Tantor Media, Inc. (Audiolibro): 9781977383549

Data di uscita

Audiolibro: 12 giugno 2018

Tag

- Data ScienceJohn D. Kelleher
- Uberland: How Algorithms Are Rewriting the Rules of WorkAlex Rosenblat
- The Creativity Code: How AI is learning to write, paint and thinkMarcus du Sautoy
- Coders: Who They Are, What They Think and How They Are Changing Our WorldClive Thompson
- Computational ThinkingPeter J. Denning
- What We Cannot Know: Explorations at the Edge of KnowledgeMarcus du Sautoy
- How Smart Machines ThinkSean Gerrish
- The Formula: How Algorithms Solve all our Problems... and Create MoreLuke Dormehl
- Range: How Generalists Triumph in a Specialized WorldDavid Epstein
- Astrophysics for People in a HurryNeil deGrasse Tyson

Entra in un mondo di storie

- Ascolta e leggi quanto vuoi
- Oltre 400.000 titoli
- Prova gratis per 14 giorni, poi 9.99€/mese
- Disdici quando vuoi
- Ascolta titoli esclusivi e Storytel Original

Basato su 17 valutazioni

Informativo

Illuminante

Intelligente

Scarica l'app per aggiungere una recensione

Lingua e Paese

Italiano

Italia