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

  • Safe delivery by Christmas SANTA SAFE
    Recursive Introduction to the Theory of Computation

Recursive Introduction to the Theory of Computation

Carl Smith
    Product form
      FORMAT: Hardback

      R 1,592.41 Price and availability exclusive to website

      YOU COULD EARN 1,592.41 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 265.40 per month!
      3x monthly payments of R 530.80 with
      4x fortnightly payments of R 398.10 with
      The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.
      Format: CONTRIBUTORS: Carl Smith EAN: 9780387943329 COUNTRY: United States PAGES: WEIGHT: 910 g HEIGHT: 229 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 1994-10-14 CITY: GENRE: COMPUTERS / Computer Science WIDTH: 152 cm SPINE:

      Book Themes:

      Mathematical theory of computation

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.
      Format: CONTRIBUTORS: Carl Smith EAN: 9780387943329 COUNTRY: United States PAGES: WEIGHT: 910 g HEIGHT: 229 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 1994-10-14 CITY: GENRE: COMPUTERS / Computer Science WIDTH: 152 cm SPINE:

      Book Themes:

      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