Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definab

by Rod Downey
Save 17% Save 17%
Current price ₹22,099.00
Original price ₹26,519.00
Original price ₹26,519.00
Original price ₹26,519.00
(-17%)
₹22,099.00
Current price ₹22,099.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9780691199658
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Princeton University Press
  • Publisher Imprint: Princeton University Press
  • Publication Date:
  • Pages: 296
  • Original Price: USD 205.0
  • Language: English
  • Edition: N/A
  • Item Weight: 477 grams
  • BISAC Subject(s): Logic, Computer Science, and Applied

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.

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us