MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02707cam a2200337 i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
on1299143462 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OCoLC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20220929081250.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
220224s2022 xx a b 001 0 eng d |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
YDX |
| Language of cataloging |
eng |
| Description conventions |
rda |
| Transcribing agency |
YDX |
| Modifying agency |
BDX |
| -- |
UKMGB |
| -- |
OCLCF |
| -- |
BKL |
| -- |
GWV |
| -- |
NFG |
| 015 ## - NATIONAL BIBLIOGRAPHY NUMBER |
|---|
| National bibliography number |
GBC2A5725 |
| Source |
bnb |
| 016 7# - NATIONAL BIBLIOGRAPHIC AGENCY CONTROL NUMBER |
|---|
| Record control number |
020652599 |
| Source |
Uk |
| 019 ## - |
|---|
| -- |
1298882481 |
| -- |
1298936655 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0262545292 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780262545297 |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(OCoLC)1299143462 |
| Canceled/invalid control number |
(OCoLC)1298882481 |
| -- |
(OCoLC)1298936655 |
| 092 ## - LOCALLY ASSIGNED DEWEY CALL NUMBER (OCLC) |
|---|
| Classification number |
005.1 |
| Item number |
E73 |
| 049 ## - LOCAL HOLDINGS (OCLC) |
|---|
| Holding library |
NFGA |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Erwig, Martin, |
| Relator term |
author. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Once upon an algorithm : |
| Remainder of title |
how stories explain computing / |
| Statement of responsibility, etc |
Martin Erwig. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE STATEMENTS |
|---|
| Place of production, publication, distribution, manufacture |
Cambridge, Massachusetts : |
| Name of producer, publisher, distributor, manufacturer |
The MIT Press, |
| Date of production, publication, distribution, manufacture |
2022. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xii, 319 pages : |
| Other physical details |
illustrations (black and white) ; |
| Dimensions |
23 cm |
| 336 ## - CONTENT TYPE |
|---|
| Content Type Term |
text |
| Source |
rdacontent |
| 336 ## - CONTENT TYPE |
|---|
| Content Type Term |
still image |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
|---|
| Media Type Term |
unmediated |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Carrier Type Term |
volume |
| Source |
rdacarrier |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
"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 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer algorithms |
| Form subdivision |
Popular works. |
| 9 (RLIN) |
347657 |
| 994 ## - |
|---|
| -- |
C0 |
| -- |
NFG |
