A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability
Available on compatible , the free NOOK App, and in My Digital Library
NOOK App
Download NOOK app
NOOK Devices
NOOK eReaders
- NOOK GlowLight 4 Plus
- NOOK GlowLight 4e
- NOOK GlowLight 4
- NOOK GlowLight Plus 7.8"
- NOOK GlowLight 3
- NOOK GlowLight Plus 6"
NOOK Tablets
- NOOK 9" Lenovo Tablet
- NOOK 10" HD Lenovo Tablet
- NOOK Tablet 7" & 10.1"
- NOOK by Samsung Galaxy Tab 7.0 [Tab A and Tab 4]
- NOOK by Samsung [Tab 4 10.1, S2 & E]
Free NOOK Reading Apps
- NOOK for iOS
- NOOK for Android
BN.com website
Go to your Digital Library in My Account
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 rando...



