FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

Theories of Computability

Nicholas Pippenger
    Product form
      FORMAT: Hardback

      R 5,694.91 Price and availability exclusive to website

      YOU COULD EARN 5,694.91 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 949.15 per month!
      3x monthly payments of R 1,898.30 with
      4x fortnightly payments of R 1,423.72 with
      This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.
      Format: CONTRIBUTORS: Nicholas Pippenger EAN: 9780521553803 COUNTRY: United Kingdom PAGES: WEIGHT: 560 g HEIGHT: 229 cm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 1997-05-28 CITY: GENRE: COMPUTERS / Languages / General WIDTH: 152 cm SPINE:

      Book Themes:

      Mathematical logic, Mathematical theory of computation

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.
      Format: CONTRIBUTORS: Nicholas Pippenger EAN: 9780521553803 COUNTRY: United Kingdom PAGES: WEIGHT: 560 g HEIGHT: 229 cm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 1997-05-28 CITY: GENRE: COMPUTERS / Languages / General WIDTH: 152 cm SPINE:

      Book Themes:

      Mathematical logic, Mathematical theory of computation

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account