Once upon an algorithm: how stories explain computing
(Book)
"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" -- From the publisher.
Notes
Erwig, M. (2017). Once upon an algorithm: how stories explain computing. Cambridge, Massachusetts, The MIT Press.
Chicago / Turabian - Author Date Citation (style guide)Erwig, Martin. 2017. Once Upon an Algorithm: How Stories Explain Computing. Cambridge, Massachusetts, The MIT Press.
Chicago / Turabian - Humanities Citation (style guide)Erwig, Martin, Once Upon an Algorithm: How Stories Explain Computing. Cambridge, Massachusetts, The MIT Press, 2017.
MLA Citation (style guide)Erwig, Martin. Once Upon an Algorithm: How Stories Explain Computing. Cambridge, Massachusetts, The MIT Press, 2017.
Record Information
Last Sierra Extract Time | Mar 20, 2024 07:30:14 PM |
---|---|
Last File Modification Time | Mar 20, 2024 07:30:45 PM |
Last Grouped Work Modification Time | Mar 20, 2024 07:30:21 PM |
MARC Record
LEADER | 03807cam a2200433 i 4500 | ||
---|---|---|---|
001 | 965754167 | ||
003 | OCoLC | ||
005 | 20180201080107.0 | ||
008 | 161128s2017 maua b 001 0 eng | ||
010 | |a 2016053945 | ||
020 | |a 9780262036634|q hardcover ;|q alkaline paper | ||
020 | |a 0262036630|q hardcover ;|q alkaline paper | ||
035 | |a (Sirsi) l2016053945 | ||
035 | |a (OCoLC)965754167 | ||
040 | |a DLC|b eng|e rda|c DLC|d OCLCF|d BDX|d OCLCQ|d BTCTA|d YDX|d YDX|d SOI|d GUA | ||
042 | |a pcc | ||
049 | |a EB$A|n cy | ||
050 | 0 | 0 | |a QA76.9.A43|b E78 2017 |
082 | 0 | 0 | |a 005.1|2 23 |
099 | |a 005.1|a ERWIG,MA|a 2017 | ||
100 | 1 | |a Erwig, Martin,|0 https://id.loc.gov/authorities/names/no2010074954|e author. | |
245 | 1 | 0 | |a Once upon an algorithm :|b how stories explain computing /|c Martin Erwig. |
264 | 1 | |a Cambridge, Massachusetts :|b The MIT Press,|c [2017] | |
300 | |a xii, 319 pages :|b illustrations ;|c 24 cm | ||
336 | |a text|b txt|2 rdacontent | ||
337 | |a unmediated|b n|2 rdamedia | ||
338 | |a volume|b nc|2 rdacarrier | ||
504 | |a Includes bibliographical references (pages 303-311) and index. | ||
505 | 0 | |a A path to understanding computation -- Walk the walk : when computation really happens -- The mystery of signs -- Detective's notebook : accessory after the fact -- The search for the perfect data structure -- Sorting out sorting -- Mission intractable -- The prism of language -- Finding the right tone : sound meaning -- Weather, rinse, repeat -- Happy ending not guaranteed -- A stitch in time computes fine -- A matter of interpretation -- The magical type -- A bird's eye view : abstracting from details. | |
520 | |a "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" -- From the publisher. | ||
650 | 0 | |a Computer algorithms|0 https://id.loc.gov/authorities/subjects/sh91000149|v Popular works.|0 https://id.loc.gov/authorities/subjects/sh99001720 | |
907 | |a .b59038093 | ||
948 | |a MARCIVE Overnight, in 2023.02 | ||
989 | |1 .i12418456x|b 31813006087026|d below|g -|m |h 7|x 0|t 2|i 2|j 300|k 190216|n 03-16-2024 16:21|o -|a 005.1 ERWIG,MA 2017 | ||
994 | |a C0|b EB$ | ||
995 | |a Loaded with m2btab.ltiac in 2023.02 | ||
995 | |a Loaded with m2btab.ltiac in 2019.03 | ||
995 | |a Initial Bemis load m2btab.test019 in 2019.02 | ||
998 | |e -|f eng|a be |