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: | Buch |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Yanofsky, Noson S. |
| description | 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. |
| doi_str_mv | 10.1017/9781108872348 |
| format | Book |
| fullrecord | <record><control><sourceid>proquest_askew</sourceid><recordid>TN_cdi_askewsholts_vlebooks_9781108890670</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_9781108872348</cupid><sourcerecordid>EBC6921534</sourcerecordid><originalsourceid>FETCH-LOGICAL-a10351-8332c8150f61d12cb86685b3a7c2d0902accc07fe14bceba611e5177e897a0143</originalsourceid><addsrcrecordid>eNpVkL1PwzAQR40QCCgd2bMhhsKdndjOggRR-ZCQGKiALXLcSxua1sV2Qfz3tA0gMZ2e9O43PMZOEM4RUF3kSiOC1oqLVO-woz9IdztQOVfp6_4aeC6F1mnKD1g_hDcA4FJzpdUhuxxNyXmKjTVtUrj5chXJJ0-2oYWlpHY-iVNKXpyfNYtJUphIE-e_ku1XE-Ix26tNG6j_c3vs-WY4Ku4GD4-398XVw8AgiAwHWghuNWZQSxwjt5WWUmeVMMryMeTAjbUWVE2YVpYqIxEpQ6VI58oApqLHzrphE2b0GaaujaH8aKlybhbK3xY5SAVr97Rzl969ryjEcqtZWkRv2nJ4XcicYyY2q9CZ1swr34wnVNp1jW4UodyELv-FFt8BfGrQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>book</recordtype><pqid>EBC6921534</pqid></control><display><type>book</type><title>Theoretical Computer Science for the Working Category Theorist</title><source>Cambridge Core All Books</source><creator>Yanofsky, Noson S.</creator><creatorcontrib>Yanofsky, Noson S.</creatorcontrib><description>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.</description><edition>1</edition><identifier>ISBN: 110879274X</identifier><identifier>ISBN: 9781108792745</identifier><identifier>EISBN: 1108872344</identifier><identifier>EISBN: 9781108872348</identifier><identifier>EISBN: 9781108890670</identifier><identifier>EISBN: 1108890679</identifier><identifier>DOI: 10.1017/9781108872348</identifier><identifier>OCLC: 1296388442</identifier><language>eng</language><publisher>Cambridge: Cambridge University Press</publisher><subject>Computer science</subject><creationdate>2022</creationdate><tpages>148</tpages><format>148</format><rights>Noson S. Yanofsky 2022</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Elements in applied category theory</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>306,776,780,782,27902,54041</link.rule.ids></links><search><creatorcontrib>Yanofsky, Noson S.</creatorcontrib><title>Theoretical Computer Science for the Working Category Theorist</title><description>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.</description><subject>Computer science</subject><isbn>110879274X</isbn><isbn>9781108792745</isbn><isbn>1108872344</isbn><isbn>9781108872348</isbn><isbn>9781108890670</isbn><isbn>1108890679</isbn><fulltext>true</fulltext><rsrctype>book</rsrctype><creationdate>2022</creationdate><recordtype>book</recordtype><sourceid/><recordid>eNpVkL1PwzAQR40QCCgd2bMhhsKdndjOggRR-ZCQGKiALXLcSxua1sV2Qfz3tA0gMZ2e9O43PMZOEM4RUF3kSiOC1oqLVO-woz9IdztQOVfp6_4aeC6F1mnKD1g_hDcA4FJzpdUhuxxNyXmKjTVtUrj5chXJJ0-2oYWlpHY-iVNKXpyfNYtJUphIE-e_ku1XE-Ix26tNG6j_c3vs-WY4Ku4GD4-398XVw8AgiAwHWghuNWZQSxwjt5WWUmeVMMryMeTAjbUWVE2YVpYqIxEpQ6VI58oApqLHzrphE2b0GaaujaH8aKlybhbK3xY5SAVr97Rzl969ryjEcqtZWkRv2nJ4XcicYyY2q9CZ1swr34wnVNp1jW4UodyELv-FFt8BfGrQ</recordid><startdate>20220125</startdate><enddate>20220125</enddate><creator>Yanofsky, Noson S.</creator><general>Cambridge University Press</general><scope/></search><sort><creationdate>20220125</creationdate><title>Theoretical Computer Science for the Working Category Theorist</title><author>Yanofsky, Noson S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a10351-8332c8150f61d12cb86685b3a7c2d0902accc07fe14bceba611e5177e897a0143</frbrgroupid><rsrctype>books</rsrctype><prefilter>books</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer science</topic><toplevel>online_resources</toplevel><creatorcontrib>Yanofsky, Noson S.</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yanofsky, Noson S.</au><format>book</format><genre>book</genre><ristype>BOOK</ristype><btitle>Theoretical Computer Science for the Working Category Theorist</btitle><seriestitle>Elements in applied category theory</seriestitle><date>2022-01-25</date><risdate>2022</risdate><isbn>110879274X</isbn><isbn>9781108792745</isbn><eisbn>1108872344</eisbn><eisbn>9781108872348</eisbn><eisbn>9781108890670</eisbn><eisbn>1108890679</eisbn><abstract>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.</abstract><cop>Cambridge</cop><pub>Cambridge University Press</pub><doi>10.1017/9781108872348</doi><oclcid>1296388442</oclcid><tpages>148</tpages><edition>1</edition><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISBN: 110879274X |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_askewsholts_vlebooks_9781108890670 |
| source | Cambridge Core All Books |
| subjects | Computer science |
| title | Theoretical Computer Science for the Working Category Theorist |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T06%3A01%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_askew&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=book&rft.btitle=Theoretical%20Computer%20Science%20for%20the%20Working%20Category%20Theorist&rft.au=Yanofsky,%20Noson%20S.&rft.date=2022-01-25&rft.isbn=110879274X&rft.isbn_list=9781108792745&rft_id=info:doi/10.1017/9781108872348&rft_dat=%3Cproquest_askew%3EEBC6921534%3C/proquest_askew%3E%3Curl%3E%3C/url%3E&rft.eisbn=1108872344&rft.eisbn_list=9781108872348&rft.eisbn_list=9781108890670&rft.eisbn_list=1108890679&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC6921534&rft_id=info:pmid/&rft_cupid=10_1017_9781108872348&rfr_iscdi=true |