|
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes
Paperback / softback
Main Details
| Title |
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes
|
| Authors and Contributors |
By (author) Rod Downey
|
|
By (author) Noam Greenberg
|
| Series | Annals of Mathematics Studies |
|---|
| Physical Properties |
| Format:Paperback / softback | | Pages:240 | | Dimensions(mm): Height 235,Width 156 |
|
| Category/Genre | Applied mathematics
Computer science |
|---|
| ISBN/Barcode |
9780691199665
|
| Classifications | Dewey:511.3 |
|---|
| Audience | |
|---|
| Illustrations |
3 b/w illus.
|
|
Publishing Details |
| Publisher |
Princeton University Press
|
| Imprint |
Princeton University Press
|
| Publication Date |
16 June 2020 |
| Publication Country |
United States
|
Description
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
Author Biography
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.
|
