
Tell your friends about this item:
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability - Annals of Mathematics Studies
Rod Downey
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability - Annals of Mathematics Studies
Rod Downey
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
240 pages, 3 b/w illus.
Media | Books Hardcover Book (Book with hard spine and cover) |
Released | June 16, 2020 |
ISBN13 | 9780691199658 |
Publishers | Princeton University Press |
Pages | 240 |
Dimensions | 241 × 164 × 15 mm · 522 g |