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

  • Not safe to deliver by Christmas NOTSANTA SAFE
    Algorithmic Information Theory

Algorithmic Information Theory

Gregory. J. Chaitin
    Product form
      FORMAT: Paperback / softback

      R 2,422.00 Price and availability exclusive to website

      YOU COULD EARN 2,422 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 20 - 30 Business Days
      BUY NOW PAY LATER
      From R 403.66 per month!
      3x monthly payments of R 807.33 with
      4x fortnightly payments of R 605.50 with

      Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.

      Format: Paperback / softback CONTRIBUTORS: Gregory. J. Chaitin EAN: 9780521616041 COUNTRY: United Kingdom PAGES: 192 WEIGHT: 345 g HEIGHT: 246 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2004-12-02 CITY: GENRE: COMPUTERS / Machine Theory, MATHEMATICS / Logic WIDTH: 188 mm 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)

      Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.

      Format: Paperback / softback CONTRIBUTORS: Gregory. J. Chaitin EAN: 9780521616041 COUNTRY: United Kingdom PAGES: 192 WEIGHT: 345 g HEIGHT: 246 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2004-12-02 CITY: GENRE: COMPUTERS / Machine Theory, MATHEMATICS / Logic WIDTH: 188 mm 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