A hierarchy of Turing degrees a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability - Downey, R. G. (Rod G.); Greenberg, Noam 1974- (Cambridge, Massachusetts The MIT Press, 2020)
Electronic reproduction
Keywords: Unsolvability (Mathematical logic); Computable functions; Recursively enumerable sets; Electronic books