000			03204cam a2200325 i 4500
001			ocn965754167
003			OCoLC
005			20180722225606.0
008			161128s2017 maua b 001 0 eng
010			_a 2016053945
040			_aDLC _beng _erda _cDLC _dOCLCF _dBDX _dOCLCQ _dBTCTA _dYDX _dYDX _dSOI _dGUA _dNFG
020			_a9780262036634 _qhardcover ; _qalkaline paper
020			_a0262036630 _qhardcover ; _qalkaline paper
035			_a(OCoLC)965754167
042			_apcc
092			_a005.1 _bE73
049			_aNFGA
100	1		_aErwig, Martin, _eauthor. _9347656
245	1	0	_aOnce upon an algorithm : _bhow stories explain computing / _cMartin Erwig.
264		1	_aCambridge, Massachusetts : _bThe MIT Press, _c[2017]
300			_axii, 319 pages : _billustrations ; _c24 cm
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
504			_aIncludes bibliographical references (pages 303-311) and index.
505	0		_aA 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	_aComputer algorithms _vPopular works. _9347657
994			_aC0 _bNFG
999			_c265187 _d265187