Once Upon an Algorithm:
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 dele...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
[Erscheinungsort nicht ermittelbar]
Tantor Media, Inc.
2018
|
| Edition: | 1st edition. |
| Subjects: | |
| Links: | https://learning.oreilly.com/library/view/-/9781977393548/?ar |
| Summary: | 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. |
| Item Description: | Online resource; Title from title page (viewed June 12, 2018) |
| Physical Description: | 1 Online-Ressource (1 sound file) |
| ISBN: | 9781977393548 1977393543 |
Staff View
MARC
| LEADER | 00000cam a22000002 4500 | ||
|---|---|---|---|
| 001 | ZDB-30-ORH-071018212 | ||
| 003 | DE-627-1 | ||
| 005 | 20240228121536.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 211206s2018 xx |||||o 00| ||eng c | ||
| 020 | |a 9781977393548 |9 978-1-9773-9354-8 | ||
| 020 | |a 1977393543 |9 1-9773-9354-3 | ||
| 035 | |a (DE-627-1)071018212 | ||
| 035 | |a (DE-599)KEP071018212 | ||
| 035 | |a (ORHE)9781977393548 | ||
| 035 | |a (DE-627-1)071018212 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 100 | 1 | |a Erwig, Martin |e VerfasserIn |4 aut | |
| 245 | 1 | 0 | |a Once Upon an Algorithm |c Erwig, Martin |
| 250 | |a 1st edition. | ||
| 264 | 1 | |a [Erscheinungsort nicht ermittelbar] |b Tantor Media, Inc. |c 2018 | |
| 300 | |a 1 Online-Ressource (1 sound file) | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Online resource; Title from title page (viewed June 12, 2018) | ||
| 520 | |a 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. | ||
| 650 | 0 | |a Computers | |
| 650 | 2 | |a Computers | |
| 650 | 4 | |a Ordinateurs | |
| 650 | 4 | |a computers | |
| 650 | 4 | |a Computers |0 (OCoLC)fst00872776 | |
| 650 | 4 | |a Downloadable audio books | |
| 650 | 4 | |a Audiobooks |0 (OCoLC)fst01726208 | |
| 650 | 4 | |a Audiobooks | |
| 650 | 4 | |a Livres audio | |
| 700 | 1 | |a Dixon, Walter |e ErzählerIn |4 nrt | |
| 966 | 4 | 0 | |l DE-91 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781977393548/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
| 912 | |a ZDB-30-ORH | ||
| 912 | |a ZDB-30-ORH | ||
| 951 | |a BO | ||
| 912 | |a ZDB-30-ORH | ||
| 049 | |a DE-91 | ||
Record in the Search Index
| DE-BY-TUM_katkey | ZDB-30-ORH-071018212 |
|---|---|
| _version_ | 1821494826862903296 |
| adam_text | |
| any_adam_object | |
| author | Erwig, Martin |
| author2 | Dixon, Walter |
| author2_role | nrt |
| author2_variant | w d wd |
| author_facet | Erwig, Martin Dixon, Walter |
| author_role | aut |
| author_sort | Erwig, Martin |
| author_variant | m e me |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-30-ORH |
| ctrlnum | (DE-627-1)071018212 (DE-599)KEP071018212 (ORHE)9781977393548 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 1st edition. |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03246cam a22004812 4500</leader><controlfield tag="001">ZDB-30-ORH-071018212</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20240228121536.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">211206s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781977393548</subfield><subfield code="9">978-1-9773-9354-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1977393543</subfield><subfield code="9">1-9773-9354-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)071018212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP071018212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781977393548</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)071018212</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Erwig, Martin</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Once Upon an Algorithm</subfield><subfield code="c">Erwig, Martin</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st edition.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[Erscheinungsort nicht ermittelbar]</subfield><subfield code="b">Tantor Media, Inc.</subfield><subfield code="c">2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (1 sound file)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Online resource; Title from title page (viewed June 12, 2018)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ordinateurs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield><subfield code="0">(OCoLC)fst00872776</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Downloadable audio books</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Audiobooks</subfield><subfield code="0">(OCoLC)fst01726208</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Audiobooks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Livres audio</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dixon, Walter</subfield><subfield code="e">ErzählerIn</subfield><subfield code="4">nrt</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781977393548/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-30-ORH-071018212 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-17T11:20:33Z |
| institution | BVB |
| isbn | 9781977393548 1977393543 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (1 sound file) |
| psigel | ZDB-30-ORH TUM_PDA_ORH ZDB-30-ORH |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Tantor Media, Inc. |
| record_format | marc |
| spelling | Erwig, Martin VerfasserIn aut Once Upon an Algorithm Erwig, Martin 1st edition. [Erscheinungsort nicht ermittelbar] Tantor Media, Inc. 2018 1 Online-Ressource (1 sound file) Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Online resource; Title from title page (viewed June 12, 2018) 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. Computers Ordinateurs computers Computers (OCoLC)fst00872776 Downloadable audio books Audiobooks (OCoLC)fst01726208 Audiobooks Livres audio Dixon, Walter ErzählerIn nrt |
| spellingShingle | Erwig, Martin Once Upon an Algorithm Computers Ordinateurs computers Computers (OCoLC)fst00872776 Downloadable audio books Audiobooks (OCoLC)fst01726208 Audiobooks Livres audio |
| subject_GND | (OCoLC)fst00872776 (OCoLC)fst01726208 |
| title | Once Upon an Algorithm |
| title_auth | Once Upon an Algorithm |
| title_exact_search | Once Upon an Algorithm |
| title_full | Once Upon an Algorithm Erwig, Martin |
| title_fullStr | Once Upon an Algorithm Erwig, Martin |
| title_full_unstemmed | Once Upon an Algorithm Erwig, Martin |
| title_short | Once Upon an Algorithm |
| title_sort | once upon an algorithm |
| topic | Computers Ordinateurs computers Computers (OCoLC)fst00872776 Downloadable audio books Audiobooks (OCoLC)fst01726208 Audiobooks Livres audio |
| topic_facet | Computers Ordinateurs computers Downloadable audio books Audiobooks Livres audio |
| work_keys_str_mv | AT erwigmartin onceuponanalgorithm AT dixonwalter onceuponanalgorithm |