Description

Book Synopsis
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.

Table of Contents
1. Introduction; 2. Aide-Mémoire for Category Theory; 3. Models of Computation; 4. Computability Theory; 5. Complexity Theory; 6. Diagonal Arguments; 7. Conclusion; References.

Theoretical Computer Science for the Working

Product form

£17.00

Includes FREE delivery

Order before 4pm today for delivery by Sat 10 Jan 2026.

A Paperback by Noson S. Yanofsky

1 in stock


    View other formats and editions of Theoretical Computer Science for the Working by Noson S. Yanofsky

    Publisher: Cambridge University Press
    Publication Date: 3/3/2022 12:00:00 AM
    ISBN13: 9781108792745, 978-1108792745
    ISBN10: 110879274X
    Also in:
    Mathematical theory of computation

    Description

    Book Synopsis
    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.

    Table of Contents
    1. Introduction; 2. Aide-Mémoire for Category Theory; 3. Models of Computation; 4. Computability Theory; 5. Complexity Theory; 6. Diagonal Arguments; 7. Conclusion; References.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account