Articles liés à Once Upon an Algorithm: How Stories Explain Computing
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Martin Erwig is Professor of Computer Science in the School of Electrical Engineering and Computer Science at Oregon State University.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 24,30
EUR 2,32 expédition depuis Royaume-Uni vers France
Destinations, frais et délais
Résultats de recherche pour Once Upon an Algorithm: How Stories Explain Computing
Image d'archives
Once Upon an Algorithm: How Stories Explain Computing
Edité par
The MIT Press, 2022
ISBN 10 : 0262545292
ISBN 13 : 9780262545297
Ancien ou d'occasion
paperback
Vendeur : Bellwetherbooks, McKeesport, PA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
paperback. Etat : Very Good. Very Good Condition - May show some limited signs of wear and may have a remainder mark. Pages and dust cover are intact and not marred by notes or highlighting. N° de réf. du vendeur MIT-PB-VG-0262545292
Quantité disponible : 3 disponible(s)
Image d'archives
Once Upon an Algorithm: How Stories Explain Computing
Edité par
The MIT Press, 2022
ISBN 10 : 0262545292
ISBN 13 : 9780262545297
Ancien ou d'occasion
Paperback
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Good. N° de réf. du vendeur mon0003680143
Quantité disponible : 1 disponible(s)
Image d'archives
Once Upon an Algorithm: How Stories Explain Computing
Edité par
The MIT Press (edition ), 2022
ISBN 10 : 0262545292
ISBN 13 : 9780262545297
Ancien ou d'occasion
Paperback
Vendeur : BooksRun, Philadelphia, PA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Very Good. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. N° de réf. du vendeur 0262545292-8-1
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Once Upon an Algorithm
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. 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. N° de réf. du vendeur LU-9780262545297
Quantité disponible : Plus de 20 disponibles
Image d'archives
Once Upon an Algorithm: How Stories Explain Computing
Edité par
The MIT Press, 2022
ISBN 10 : 0262545292
ISBN 13 : 9780262545297
Ancien ou d'occasion
paperback
Vendeur : Magers and Quinn Booksellers, Minneapolis, MN, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
paperback. Etat : Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages. N° de réf. du vendeur 1488235
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Once Upon an Algorithm
Vendeur : Rarewaves USA, OSWEGO, IL, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. 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. N° de réf. du vendeur LU-9780262545297
Quantité disponible : Plus de 20 disponibles
Image d'archives
Once Upon an Algorithm: How Stories Explain Computing?
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. 2022. Paperback. . . . . . N° de réf. du vendeur V9780262545297
Quantité disponible : 15 disponible(s)
Image d'archives
Once Upon an Algorithm
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur DB-9780262545297
Quantité disponible : 2 disponible(s)
Image d'archives
Once Upon an Algorithm: How Stories Explain Computing
Edité par
The MIT Press Bookstore, 2022
ISBN 10 : 0262545292
ISBN 13 : 9780262545297
Neuf
Couverture souple
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 26395183658
Quantité disponible : 3 disponible(s)
Image fournie par le vendeur
Once Upon an Algorithm
Vendeur : Rarewaves USA United, OSWEGO, IL, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. 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. N° de réf. du vendeur LU-9780262545297
Quantité disponible : Plus de 20 disponibles