Articoli correlati a Once Upon an Algorithm: How Stories Explain Computing

Once Upon an Algorithm: How Stories Explain Computing - Brossura

 
9780262545297: Once Upon an Algorithm: How Stories Explain Computing

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

Martin Erwig is Professor of Computer Science in the School of Electrical Engineering and Computer Science at Oregon State University.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Compra usato

Condizioni: molto buono
Very Good Condition - May show...
Visualizza questo articolo

EUR 10,34 per la spedizione da U.S.A. a Italia

Destinazione, tempi e costi

EUR 2,32 per la spedizione da Regno Unito a Italia

Destinazione, tempi e costi

Altre edizioni note dello stesso titolo

9780262036634: Once Upon an Algorithm: How Stories Explain Computing

Edizione in evidenza

ISBN 10:  0262036630 ISBN 13:  9780262036634
Casa editrice: The MIT Press, 2017
Rilegato

Risultati della ricerca per Once Upon an Algorithm: How Stories Explain Computing

Foto dell'editore

Erwig, Martin
Editore: The MIT Press, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Antico o usato paperback

Da: Bellwetherbooks, McKeesport, PA, U.S.A.

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

paperback. Condizione: Very Good. Very Good Condition - May show some limited signs of wear and may have a remainder mark. Pages and dust cover are intact and not marred by notes or highlighting. Codice articolo MIT-PB-VG-0262545292

Contatta il venditore

Compra usato

EUR 4,03
Convertire valuta
Spese di spedizione: EUR 10,34
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: 3 disponibili

Aggiungi al carrello

Foto dell'editore

Erwig, Martin
Editore: The MIT Press, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Antico o usato Paperback

Da: Books From California, Simi Valley, CA, U.S.A.

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

Paperback. Condizione: Good. Codice articolo mon0003680143

Contatta il venditore

Compra usato

EUR 3,73
Convertire valuta
Spese di spedizione: EUR 12,31
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: 1 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Martin Erwig
Editore: MIT Press Ltd, US, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Nuovo Paperback

Da: Rarewaves.com UK, London, Regno Unito

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

Paperback. Condizione: New. 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. Codice articolo LU-9780262545297

Contatta il venditore

Compra nuovo

EUR 24,18
Convertire valuta
Spese di spedizione: EUR 2,32
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Foto dell'editore

Martin Erwig
Editore: MIT Press Ltd, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Nuovo Brossura

Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. 2022. Paperback. . . . . . Codice articolo V9780262545297

Contatta il venditore

Compra nuovo

EUR 24,54
Convertire valuta
Spese di spedizione: EUR 2,00
Da: Irlanda a: Italia
Destinazione, tempi e costi

Quantità: 15 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Martin Erwig
Editore: MIT Press Ltd, US, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Nuovo Paperback

Da: Rarewaves USA, OSWEGO, IL, U.S.A.

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

Paperback. Condizione: New. 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. Codice articolo LU-9780262545297

Contatta il venditore

Compra nuovo

EUR 24,14
Convertire valuta
Spese di spedizione: EUR 3,40
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Foto dell'editore

Martin Erwig
Editore: The MIT Press Bookstore, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Nuovo Brossura

Da: Books Puddle, New York, NY, U.S.A.

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. Codice articolo 26395183658

Contatta il venditore

Compra nuovo

EUR 20,40
Convertire valuta
Spese di spedizione: EUR 7,64
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: 3 disponibili

Aggiungi al carrello

Foto dell'editore

Martin Erwig
Editore: MIT Press, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Nuovo PAP

Da: PBShop.store UK, Fairford, GLOS, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo DB-9780262545297

Contatta il venditore

Compra nuovo

EUR 22,29
Convertire valuta
Spese di spedizione: EUR 6,09
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: 2 disponibili

Aggiungi al carrello

Foto dell'editore

ERWIG, MARTIN
Editore: The MIT Press, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Nuovo Brossura

Da: Speedyhen, London, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: NEW. Codice articolo NW9780262545297

Contatta il venditore

Compra nuovo

EUR 21,05
Convertire valuta
Spese di spedizione: EUR 8,10
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: 1 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Martin Erwig
Editore: MIT Press Ltd, US, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Nuovo Paperback

Da: Rarewaves USA United, OSWEGO, IL, U.S.A.

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

Paperback. Condizione: New. 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. Codice articolo LU-9780262545297

Contatta il venditore

Compra nuovo

EUR 25,85
Convertire valuta
Spese di spedizione: EUR 3,40
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Martin Erwig
Editore: MIT Press, 2022
ISBN 10: 0262545292 ISBN 13: 9780262545297
Nuovo Brossura

Da: moluna, Greven, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. Martin Erwig is Professor of Computer Science in the School of Electrical Engineering and Computer Science at Oregon State University.This easy-to-follow introduction to computer science reveals how familiar stories like Hansel and Gretel, Sherlock H. Codice articolo 573319632

Contatta il venditore

Compra nuovo

EUR 20,77
Convertire valuta
Spese di spedizione: EUR 9,70
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: 2 disponibili

Aggiungi al carrello

Vedi altre 25 copie di questo libro

Vedi tutti i risultati per questo libro