Once upon an algorithm: How stories explain computing
How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts of computing
Saved in:
Main Author: | |
---|---|
Format: | Electronic eBook |
Language: | English |
Published: |
Cambridge
MIT Press
2017
|
Subjects: | |
Links: | https://ieeexplore.ieee.org/servlet/opac?bknumber=8029869 https://ieeexplore.ieee.org/servlet/opac?bknumber=8029869 |
Summary: | How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts of computing |
Item Description: | Description based on publisher supplied metadata and other sources |
Physical Description: | 1 online resource (xii, 319 pages) |
ISBN: | 9780262341691 |
Staff View
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV044617070 | ||
003 | DE-604 | ||
005 | 20190204 | ||
007 | cr|uuu---uuuuu | ||
008 | 171108s2017 xx o|||| 00||| eng d | ||
020 | |a 9780262341691 |9 978-0-262-34169-1 | ||
035 | |a (ZDB-30-PQE)EBC4980898 | ||
035 | |a (ZDB-89-EBL)EBL4980898 | ||
035 | |a (ZDB-38-EBR)ebr11428224 | ||
035 | |a (OCoLC)1001288136 | ||
035 | |a (DE-599)BVBBV044617070 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-573 | ||
082 | 0 | |a 005.1 | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
100 | 1 | |a Erwig, Martin |e Verfasser |4 aut | |
245 | 1 | 0 | |a Once upon an algorithm |b How stories explain computing |
264 | 1 | |a Cambridge |b MIT Press |c 2017 | |
264 | 4 | |c © 2017 | |
300 | |a 1 online resource (xii, 319 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a Description based on publisher supplied metadata and other sources | ||
520 | |a How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts of computing | ||
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
655 | 7 | |8 1\p |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Erwig, Martin |t Once upon an Algorithm : How Stories Explain Computing |d Cambridge : MIT Press,c2017 |z 9780262036634 |
856 | 4 | 0 | |u https://ieeexplore.ieee.org/servlet/opac?bknumber=8029869 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-30-PQE | ||
912 | |a ZDB-37-IEM | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-030015416 | |
966 | e | |u https://ieeexplore.ieee.org/servlet/opac?bknumber=8029869 |l DE-573 |p ZDB-37-IEM |x Verlag |3 Volltext |
Record in the Search Index
_version_ | 1818983689969729536 |
---|---|
any_adam_object | |
author | Erwig, Martin |
author_facet | Erwig, Martin |
author_role | aut |
author_sort | Erwig, Martin |
author_variant | m e me |
building | Verbundindex |
bvnumber | BV044617070 |
classification_rvk | ST 134 |
collection | ZDB-30-PQE ZDB-37-IEM |
ctrlnum | (ZDB-30-PQE)EBC4980898 (ZDB-89-EBL)EBL4980898 (ZDB-38-EBR)ebr11428224 (OCoLC)1001288136 (DE-599)BVBBV044617070 |
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 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01922nam a2200469zc 4500</leader><controlfield tag="001">BV044617070</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190204 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">171108s2017 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262341691</subfield><subfield code="9">978-0-262-34169-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC4980898</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL4980898</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr11428224</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1001288136</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044617070</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-573</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Erwig, Martin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Once upon an algorithm</subfield><subfield code="b">How stories explain computing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">MIT Press</subfield><subfield code="c">2017</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 319 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</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</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Erwig, Martin</subfield><subfield code="t">Once upon an Algorithm : How Stories Explain Computing</subfield><subfield code="d">Cambridge : MIT Press,c2017</subfield><subfield code="z">9780262036634</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/servlet/opac?bknumber=8029869</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-37-IEM</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030015416</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ieeexplore.ieee.org/servlet/opac?bknumber=8029869</subfield><subfield code="l">DE-573</subfield><subfield code="p">ZDB-37-IEM</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | 1\p (DE-588)4151278-9 Einführung gnd-content |
genre_facet | Einführung |
id | DE-604.BV044617070 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T18:07:07Z |
institution | BVB |
isbn | 9780262341691 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030015416 |
oclc_num | 1001288136 |
open_access_boolean | |
owner | DE-573 |
owner_facet | DE-573 |
physical | 1 online resource (xii, 319 pages) |
psigel | ZDB-30-PQE ZDB-37-IEM |
publishDate | 2017 |
publishDateSearch | 2017 |
publishDateSort | 2017 |
publisher | MIT Press |
record_format | marc |
spelling | Erwig, Martin Verfasser aut Once upon an algorithm How stories explain computing Cambridge MIT Press 2017 © 2017 1 online resource (xii, 319 pages) txt rdacontent c rdamedia cr rdacarrier Description based on publisher supplied metadata and other sources How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts of computing Algorithmus (DE-588)4001183-5 gnd rswk-swf 1\p (DE-588)4151278-9 Einführung gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Erscheint auch als Druck-Ausgabe Erwig, Martin Once upon an Algorithm : How Stories Explain Computing Cambridge : MIT Press,c2017 9780262036634 https://ieeexplore.ieee.org/servlet/opac?bknumber=8029869 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Erwig, Martin Once upon an algorithm How stories explain computing Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4001183-5 (DE-588)4151278-9 |
title | Once upon an algorithm How stories explain computing |
title_auth | Once upon an algorithm How stories explain computing |
title_exact_search | Once upon an algorithm How stories explain computing |
title_full | Once upon an algorithm How stories explain computing |
title_fullStr | Once upon an algorithm How stories explain computing |
title_full_unstemmed | Once upon an algorithm How stories explain computing |
title_short | Once upon an algorithm |
title_sort | once upon an algorithm how stories explain computing |
title_sub | How stories explain computing |
topic | Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Algorithmus Einführung |
url | https://ieeexplore.ieee.org/servlet/opac?bknumber=8029869 |
work_keys_str_mv | AT erwigmartin onceuponanalgorithmhowstoriesexplaincomputing |