Items related to 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.
"synopsis" may belong to another edition of this title.
About the Author
Martin Erwig is Professor of Computer Science in the School of Electrical Engineering and Computer Science at Oregon State University.
"About this title" may belong to another edition of this title.
Search results for Once Upon an Algorithm: How Stories Explain Computing
Stock Image
Once Upon an Algorithm: How Stories Explain Computing
Seller: SecondSale, Montgomery, IL, U.S.A.
Seller rating 4 out of 5 stars
Condition: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00084648307
Quantity: 1 available
Stock Image
Once Upon an Algorithm: How Stories Explain Computing
Seller: Bellwetherbooks, McKeesport, PA, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: 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. Seller Inventory # MIT-PB-VG-0262545292
Quantity: 3 available
Stock Image
Once Upon an Algorithm: How Stories Explain Computing
Seller: Books From California, Simi Valley, CA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Good. Seller Inventory # mon0003680143
Quantity: 1 available
Stock Image
Once Upon an Algorithm: How Stories Explain Computing
Seller: HPB-Diamond, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_423784186
Quantity: 1 available
Stock Image
Once Upon an Algorithm: How Stories Explain Computing
Published by
The MIT Press (edition ), 2022
ISBN 10: 0262545292
ISBN 13: 9780262545297
Used
Paperback
Seller: BooksRun, Philadelphia, PA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 0262545292-8-1
Quantity: 1 available
Stock Image
Once Upon an Algorithm: How Stories Explain Computing
Seller: Magers and Quinn Booksellers, Minneapolis, MN, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages. Seller Inventory # 1488235
Quantity: 2 available
Stock Image
Once Upon an Algorithm: How Stories Explain Computing
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Seller Inventory # GOR013824769
Quantity: 1 available
Seller Image
Once upon an Algorithm : How Stories Explain Computing
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 44266251-n
Quantity: 15 available
Stock Image
Once Upon an Algorithm (Paperback)
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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 Potters 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780262545297
Quantity: 1 available
Seller Image
Once Upon an Algorithm
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # LU-9780262545297
Quantity: Over 20 available