{"product_id":"theoretical-computer-science-for-the-working-category-theorist-paperback-9781108792745","title":"Theoretical Computer Science for the Working Category Theorist (Paperback \/ softback) 9781108792745","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eTheoretical Computer Science for the Working Category Theorist\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eThis Element describes the major ideas and theorems of theoretical computer science with the basic language of category theory.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eNoson S. Yanofsky (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781108792745, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback \/ softback, published 3 March 2022\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e150 pages\u003cbr\u003e22.8 x 15.2 x 0.9 cm, 0.23 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'As well as having a better understanding of Category Theory, I have a new perspective on theoretical computer science: the subset of functions that comprise computable functions is somewhat ugly to formalise. This is the first in a series of Cambridge Elements: shortish works on Applied Category Theory. This one is highly recommended: I will be looking out for the others.' Susan Stepney, (http:\/\/susan-stepney.blogspot.com)\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eUsing 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e1. Introduction\u003cbr\u003e 2. Aide-Mémoire for Category Theory\u003cbr\u003e 3. Models of Computation\u003cbr\u003e 4. Computability Theory\u003cbr\u003e 5. Complexity Theory\u003cbr\u003e 6. Diagonal Arguments\u003cbr\u003e 7. Conclusion\u003cbr\u003e References.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Mathematical foundations [\u003ca title=\"See our other books on Mathematical foundations\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20foundations%20%5BPBC%5D%22\"\u003ePBC\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":45999568257304,"sku":"9781108792745","price":16.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9781108792745i_3455d4d9-d014-4a6f-9fd0-89725acf138b.jpg?v=1696719523","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/theoretical-computer-science-for-the-working-category-theorist-paperback-9781108792745","provider":"Freshly Printed Books","version":"1.0","type":"link"}