Hardcover. Condition: new. Hardcover. 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. 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 Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780691199658

Contact seller

Buy New

US$ 241.99

Convert currency

Shipping: FREE

Within U.S.A.

Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

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

Downey, Rod/ Greenberg, Noam

Published by Princeton Univ Pr, 2020

ISBN 10: 0691199655 ISBN 13: 9780691199658

New Hardcover

Print on Demand

Seller: Revaluation Books, Exeter, United Kingdom

Seller rating 5 out of 5 stars

Hardcover. Condition: Brand New. 222 pages. 9.75x6.50x0.75 inches. In Stock. This item is printed on demand. Seller Inventory # __0691199655

Contact seller

Buy New

US$ 237.90

Convert currency

Shipping: US$ 12.90

From United Kingdom to U.S.A.

Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

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

Downey, Rod|Greenberg, Noam

Published by PRINCETON UNIV PR, 2020

ISBN 10: 0691199655 ISBN 13: 9780691199658

New Hardcover

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars

Gebunden. Condition: New. &Uumlber den AutorRod 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 Co. Seller Inventory # 333725331

Contact seller