Audiobook10 hours
Once Upon an Algorithm: How Stories Explain Computing
Written by Martin Erwig
Narrated by Walter Dixon
Rating: 4 out of 5 stars
4/5
()
About this audiobook
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.
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.
Related to Once Upon an Algorithm
Related audiobooks
Computational Thinking Rating: 4 out of 5 stars4/5Understanding Software: Max Kanat-Alexander on simplicity, coding, and how to suck less as a programmer Rating: 5 out of 5 stars5/5The Formula: How Algorithms Solve all our Problems... and Create More Rating: 4 out of 5 stars4/5Nine Algorithms That Changed the Future: The Ingenious Ideas That Drive Today's Computers Rating: 5 out of 5 stars5/5Algorithm Rating: 4 out of 5 stars4/5Machine Learning: The New AI Rating: 4 out of 5 stars4/5Data Science Rating: 4 out of 5 stars4/5The Pattern on The Stone: The Simple Ideas That Make Computers Work Rating: 4 out of 5 stars4/5How Smart Machines Think Rating: 4 out of 5 stars4/5Data Science For Dummies: 2nd Edition Rating: 4 out of 5 stars4/5The Rules of Programming: How to Write Better Code Rating: 0 out of 5 stars0 ratingsDeep Learning Rating: 4 out of 5 stars4/5Data Smart: Using Data Science to Transform Information into Insight Rating: 4 out of 5 stars4/5The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World Rating: 5 out of 5 stars5/5The Deep Learning Revolution Rating: 4 out of 5 stars4/5Theory of Computation Rating: 5 out of 5 stars5/5Algorithms to Live By: The Computer Science of Human Decisions Rating: 4 out of 5 stars4/5Computer Science Rating: 1 out of 5 stars1/5Clean Code: A Handbook of Agile Software Craftsmanship Rating: 5 out of 5 stars5/5Quantum Computing Rating: 4 out of 5 stars4/5The Laws of Simplicity: Design, Technology, Business, Life Rating: 4 out of 5 stars4/5The Ethical Algorithm: The Science of Socially Aware Algorithm Design Rating: 5 out of 5 stars5/5Machine Learning Rating: 4 out of 5 stars4/5Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems Rating: 5 out of 5 stars5/5Arduino Programming: The Ultimate Intermediate Guide to Learn Arduino Programming Step by Step Rating: 5 out of 5 stars5/5AI and Machine Learning for On-Device Development: A Programmer's Guide, 1st Edition Rating: 0 out of 5 stars0 ratingsExecutive's Guide to Cloud Computing Rating: 5 out of 5 stars5/5Advances in Financial Machine Learning Rating: 5 out of 5 stars5/5
Literary Criticism For You
Fahrenheit 451 Rating: 4 out of 5 stars4/5Don't Panic: Douglas Adams and the Hitchhiker's Guide to the Galaxy Rating: 4 out of 5 stars4/5Thalia Book Club: Harper Lee's To Kill a Mockingbird 50th Anniversary Celebration Rating: 4 out of 5 stars4/5Shakespeare Rating: 4 out of 5 stars4/5Summary: Educated: A Memoir by Tara Westover: Key Takeaways, Summary & Analysis Included Rating: 5 out of 5 stars5/5The Catcher in the Rye Rating: 4 out of 5 stars4/5Bad Feminist: Essays Rating: 4 out of 5 stars4/5Pandora's Jar: Women in the Greek Myths Rating: 5 out of 5 stars5/5The Yellow-Lighted Bookshop: A Memoir, a History Rating: 4 out of 5 stars4/5Lord of the Flies Rating: 5 out of 5 stars5/5The Art of Subtext: Beyond Plot Rating: 4 out of 5 stars4/5Meet Me in the Margins Rating: 4 out of 5 stars4/5One in a Millennial: On Friendship, Feelings, Fangirls, and Fitting In Rating: 4 out of 5 stars4/5A Life of One's Own: Nine Women Writers Begin Again Rating: 5 out of 5 stars5/5The World of Robert Jordan's The Wheel of Time Rating: 4 out of 5 stars4/51984 Rating: 5 out of 5 stars5/5The Book Thief Rating: 4 out of 5 stars4/5Poetry Unbound: 50 Poems to Open Your World Rating: 5 out of 5 stars5/5To Kill a Mockingbird Rating: 3 out of 5 stars3/5C. S. Lewis: Encountering God's Truth through Fiction Rating: 5 out of 5 stars5/5Mythologies: The Complete Edition, in a New Translation Rating: 4 out of 5 stars4/5How to Read Literature Like a Professor: A Lively and Entertaining Guide to Reading Between the Lines Rating: 4 out of 5 stars4/5Thalia Book Club: Neil Gaiman: The Ocean at the End of the Lane Rating: 4 out of 5 stars4/5Reading Like a Writer: A Guide for People Who Love Books and for Those Who Want to Write Them Rating: 4 out of 5 stars4/5Common Sense Rating: 5 out of 5 stars5/5
Reviews for Once Upon an Algorithm
Rating: 4 out of 5 stars
4/5
43 ratings3 reviews
- Rating: 1 out of 5 stars1/5Great idea. But I couldn’t get through it. Sorry.
- Rating: 4 out of 5 stars4/5Muy entretenido e ilustrativo, lástima que no está completo. Aparece un error diciendo que no se puede descargar y/o que contacte a Scribd.
- Rating: 4 out of 5 stars4/5The book is laid out systematically into Algorithms and Languages. It follows a storytelling way of explaining important concepts in Computer Science.
Part One covers -- Algorithms: Where you'll take a tour of Computation, Data-Structure, Problem Solving.
Part Two covers -- Languages where you'll start with the structure of languages and end with Types and Abstraction.
I like how the author defined Computation. Computation works by transformation representations.
Representation is the basis for Computation. I liked how the author quoted Wittgenstein, Frege in talking about languages. I've read their works and got excited as I saw their names.
Overall, an excellent book.
Deus Vult,
Gottfried