Theoretical computer science for the working category theorist:
Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science....
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2022
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 TUM01 Volltext |
| Zusammenfassung: | Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises. |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 25 Jan 2022) |
| Beschreibung: | 1 Online-Ressource (138 Seiten) |
| ISBN: | 9781108872348 |
| DOI: | 10.1017/9781108872348 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047843653 | ||
| 003 | DE-604 | ||
| 005 | 20221205 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 220218s2022 |||| o||u| ||||||eng d | ||
| 020 | |a 9781108872348 |c Online |9 978-1-108-87234-8 | ||
| 024 | 7 | |a 10.1017/9781108872348 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781108872348 | ||
| 035 | |a (OCoLC)1298745932 | ||
| 035 | |a (DE-599)BVBBV047843653 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-91 | ||
| 082 | 0 | |a 004.0151 | |
| 100 | 1 | |a Yanofsky, Noson S. |d 1967- |0 (DE-588)138626839 |4 aut | |
| 245 | 1 | 0 | |a Theoretical computer science for the working category theorist |c Noson S. Yanofsky |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2022 | |
| 300 | |a 1 Online-Ressource (138 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 25 Jan 2022) | ||
| 520 | |a Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises. | ||
| 650 | 4 | |a Computer science / Mathematics | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-108-79274-5 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108872348 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-033226650 | ||
| 966 | e | |u https://doi.org/10.1017/9781108872348 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108872348 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108872348 |l TUM01 |p ZDB-20-CBO |q TUM_Paketkauf_2022 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804183402604134400 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Yanofsky, Noson S. 1967- |
| author_GND | (DE-588)138626839 |
| author_facet | Yanofsky, Noson S. 1967- |
| author_role | aut |
| author_sort | Yanofsky, Noson S. 1967- |
| author_variant | n s y ns nsy |
| building | Verbundindex |
| bvnumber | BV047843653 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781108872348 (OCoLC)1298745932 (DE-599)BVBBV047843653 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1017/9781108872348 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02257nmm a2200397zc 4500</leader><controlfield tag="001">BV047843653</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221205 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">220218s2022 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108872348</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-108-87234-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108872348</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108872348</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1298745932</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047843653</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-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yanofsky, Noson S.</subfield><subfield code="d">1967-</subfield><subfield code="0">(DE-588)138626839</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theoretical computer science for the working category theorist</subfield><subfield code="c">Noson S. Yanofsky</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (138 Seiten)</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">Title from publisher's bibliographic system (viewed on 25 Jan 2022)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-108-79274-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108872348</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-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033226650</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108872348</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108872348</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108872348</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">TUM_Paketkauf_2022</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047843653 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T19:12:57Z |
| indexdate | 2024-07-10T09:22:53Z |
| institution | BVB |
| isbn | 9781108872348 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033226650 |
| oclc_num | 1298745932 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-91 DE-BY-TUM |
| owner_facet | DE-12 DE-92 DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (138 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO TUM_Paketkauf_2022 |
| publishDate | 2022 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Yanofsky, Noson S. 1967- (DE-588)138626839 aut Theoretical computer science for the working category theorist Noson S. Yanofsky Cambridge Cambridge University Press 2022 1 Online-Ressource (138 Seiten) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 25 Jan 2022) Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises. Computer science / Mathematics Erscheint auch als Druck-Ausgabe 978-1-108-79274-5 https://doi.org/10.1017/9781108872348 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Yanofsky, Noson S. 1967- Theoretical computer science for the working category theorist Computer science / Mathematics |
| title | Theoretical computer science for the working category theorist |
| title_auth | Theoretical computer science for the working category theorist |
| title_exact_search | Theoretical computer science for the working category theorist |
| title_exact_search_txtP | Theoretical computer science for the working category theorist |
| title_full | Theoretical computer science for the working category theorist Noson S. Yanofsky |
| title_fullStr | Theoretical computer science for the working category theorist Noson S. Yanofsky |
| title_full_unstemmed | Theoretical computer science for the working category theorist Noson S. Yanofsky |
| title_short | Theoretical computer science for the working category theorist |
| title_sort | theoretical computer science for the working category theorist |
| topic | Computer science / Mathematics |
| topic_facet | Computer science / Mathematics |
| url | https://doi.org/10.1017/9781108872348 |
| work_keys_str_mv | AT yanofskynosons theoreticalcomputersciencefortheworkingcategorytheorist |