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

Hierarchy of Turing Degrees

Rod Downey, Noam Greenberg
    Product form
      FORMAT: Hardback

      R 7,427.19 Price and availability exclusive to website

      YOU COULD EARN 7,427.19 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 1,237.86 per month!
      3x monthly payments of R 2,475.73 with
      4x fortnightly payments of R 1,856.79 with
      Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
      Format: CONTRIBUTORS: Rod Downey, Noam Greenberg EAN: 9780691199658 COUNTRY: United States PAGES: WEIGHT: 0 g HEIGHT: 235 cm
      PUBLISHED BY: Princeton University Press DATE PUBLISHED: 2020-06-16 CITY: GENRE: COMPUTERS / Computer Science, MATHEMATICS / Applied, MATHEMATICS / Logic WIDTH: 156 cm SPINE:

      Book Themes:

      Mathematical logic, Applied mathematics, Computer science

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Rod Downey and Noam Greenberg are professors of mathematics at Victoria University of Wellington in New Zealand. Downey is the coauthor of Parameterized Complexity, Algorithmic Randomness and Complexity, and Fundamentals of Parameterized Complexity. Greenberg is the author of The Role of True Finiteness in the Admissible Recursively Enumerable Degrees.
      Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
      Format: CONTRIBUTORS: Rod Downey, Noam Greenberg EAN: 9780691199658 COUNTRY: United States PAGES: WEIGHT: 0 g HEIGHT: 235 cm
      PUBLISHED BY: Princeton University Press DATE PUBLISHED: 2020-06-16 CITY: GENRE: COMPUTERS / Computer Science, MATHEMATICS / Applied, MATHEMATICS / Logic WIDTH: 156 cm SPINE:

      Book Themes:

      Mathematical logic, Applied mathematics, Computer science

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Rod Downey and Noam Greenberg are professors of mathematics at Victoria University of Wellington in New Zealand. Downey is the coauthor of Parameterized Complexity, Algorithmic Randomness and Complexity, and Fundamentals of Parameterized Complexity. Greenberg is the author of The Role of True Finiteness in the Admissible Recursively Enumerable Degrees.

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account