000 02707cam a2200337 i 4500
001 on1299143462
003 OCoLC
005 20220929081250.0
008 220224s2022 xx a b 001 0 eng d
040 _aYDX
_beng
_erda
_cYDX
_dBDX
_dUKMGB
_dOCLCF
_dBKL
_dGWV
_dNFG
015 _aGBC2A5725
_2bnb
016 7 _a020652599
_2Uk
019 _a1298882481
_a1298936655
020 _a0262545292
020 _a9780262545297
035 _a(OCoLC)1299143462
_z(OCoLC)1298882481
_z(OCoLC)1298936655
092 _a005.1
_bE73
049 _aNFGA
100 1 _aErwig, Martin,
_eauthor.
245 1 0 _aOnce upon an algorithm :
_bhow stories explain computing /
_cMartin Erwig.
264 1 _aCambridge, Massachusetts :
_bThe MIT Press,
_c2022.
300 _axii, 319 pages :
_billustrations (black and white) ;
_c23 cm
336 _atext
_2rdacontent
336 _astill image
_2rdacontent
337 _aunmediated
_2rdamedia
338 _avolume
_2rdacarrier
504 _aIncludes bibliographical references and index.
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"--The publisher.
650 0 _aComputer algorithms
_vPopular works.
_9347657
994 _aC0
_bNFG
999 _c353322
_d353322