Dekorationsartikel gehören nicht zum Leistungsumfang.
Once Upon an Algorithm
How Stories Explain Computing
Taschenbuch von Martin Erwig
Sprache: Englisch

18,40 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

auf Lager, Lieferzeit 1-2 Werktage

Kategorien:
Beschreibung
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.
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.
Über den Autor
Martin Erwig
Inhaltsverzeichnis
Preface vii
Acknowledgments xi
Introduction 1
Part I Algorithms
Computation and Algorithms -- Hansel and Gretel
1 A Path to Understanding Computation 19
2 Walk the Walk: When Computation Really Happens 33
Representation and Data Structures -- Sherlock Holmes
3 The Mystery of Signs 49
4 Detective's Notebook: Accessory after the Fact 63
Problem Solving and Its Limitations -- Indiana Jones
5 The Search for the Perfect Data Structure 83
6 Sorting out Sorting 103
7 Mission Intractable 121
Part II Languages
Language and Meaning -- Over the Rainbow
8 The Prism of Language 141
9 Finding the Right Tone: Sound Meaning 159
Control Structures and Loops -- Groundhog Day
10 Weather, Rinse, Repeat 175
11 Happy Ending Not Guaranteed 189
Recursion -- Back to the Future
12 A Stitch in Time Computes Fine 205
13 A Matter of Interpretation 225
Types and Abstraction -- Harry Potter
14 The Magical Type 245
15 A Bird's Eye View: Abstracting from Details 263
Glossary 287
Notes 303
Index 313
Details
Empfohlen (von): 18
Erscheinungsjahr: 2022
Fachbereich: EDV
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Thema: Lexika
Medium: Taschenbuch
Seiten: 319
Inhalt: Einband - flex.(Paperback)
ISBN-13: 9780262545297
ISBN-10: 0262545292
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Erwig, Martin
Hersteller: The MIT Press
Abbildungen: 99 black and white illustrations
Maße: 230 x 175 x 22 mm
Von/Mit: Martin Erwig
Erscheinungsdatum: 09.08.2022
Gewicht: 0,626 kg
preigu-id: 121340414
Über den Autor
Martin Erwig
Inhaltsverzeichnis
Preface vii
Acknowledgments xi
Introduction 1
Part I Algorithms
Computation and Algorithms -- Hansel and Gretel
1 A Path to Understanding Computation 19
2 Walk the Walk: When Computation Really Happens 33
Representation and Data Structures -- Sherlock Holmes
3 The Mystery of Signs 49
4 Detective's Notebook: Accessory after the Fact 63
Problem Solving and Its Limitations -- Indiana Jones
5 The Search for the Perfect Data Structure 83
6 Sorting out Sorting 103
7 Mission Intractable 121
Part II Languages
Language and Meaning -- Over the Rainbow
8 The Prism of Language 141
9 Finding the Right Tone: Sound Meaning 159
Control Structures and Loops -- Groundhog Day
10 Weather, Rinse, Repeat 175
11 Happy Ending Not Guaranteed 189
Recursion -- Back to the Future
12 A Stitch in Time Computes Fine 205
13 A Matter of Interpretation 225
Types and Abstraction -- Harry Potter
14 The Magical Type 245
15 A Bird's Eye View: Abstracting from Details 263
Glossary 287
Notes 303
Index 313
Details
Empfohlen (von): 18
Erscheinungsjahr: 2022
Fachbereich: EDV
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Thema: Lexika
Medium: Taschenbuch
Seiten: 319
Inhalt: Einband - flex.(Paperback)
ISBN-13: 9780262545297
ISBN-10: 0262545292
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Erwig, Martin
Hersteller: The MIT Press
Abbildungen: 99 black and white illustrations
Maße: 230 x 175 x 22 mm
Von/Mit: Martin Erwig
Erscheinungsdatum: 09.08.2022
Gewicht: 0,626 kg
preigu-id: 121340414
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte