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.
"synopsis" may belong to another edition of this title.
FREE shipping within U.S.A.
Destination, rates & speedsSeller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 44002352-n
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar2317530287603
Quantity: Over 20 available
Seller: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condition: Good. New. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience. Seller Inventory # 110879274X-11-1
Quantity: 1 available
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Paperback. Condition: new. Paperback. 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 Goedel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises. This Element presents the usual material taught in a yearlong course of theoretical computer science using the intuitive language and methodology of category theory. Perfect for students or professionals working in computers or physics, or mathematics. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781108792745
Quantity: 1 available
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Paperback. Condition: New. 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. Seller Inventory # LU-9781108792745
Quantity: Over 20 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. New edition NO-PA16APR2015-KAP. Seller Inventory # 26390148655
Quantity: 1 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Seller Inventory # 389451248
Quantity: 1 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781108792745_new
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-GRD-9781108792745
Quantity: 2 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9781108792745
Quantity: 10 available