A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable...

— —

Rod Downey Noam Greenberg

A Hierarchy of Turing Degrees

A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes,...

Rod Downey, Noam Greenberg

$135

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Princeton University Press
25 August 2020

Mathematical logic; Applied mathematics; Computer science

Series: Annals of Mathematics Studies

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

By: Rod Downey, Noam Greenberg
Imprint: Princeton University Press
Country of Publication: United States
Dimensions: Height: 235mm, Width: 156mm,
ISBN: 9780691199665
ISBN 10: 0691199663
Series: Annals of Mathematics Studies
Pages: 240
Publication Date: 25 August 2020
Audience: General/trade , Professional and scholarly , General/trade , ELT Advanced , Undergraduate
Format: Paperback
Publisher's Status: Active

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.