论文信息 - Bounds in the Turing Reducibility of Functions

Bounds in the Turing Reducibility of Functions

A hierarchy of functions with respect to their role as bounds in the Turing reducibility of functions is introduced and studied. This hierarchy leads to a certain notion of incompressibility of sets which is also investigated.

Karol Habart

[1] R. Soare. Recursively enumerable sets and degrees , 1987 .

[2] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[3] Karol Habart. Bounds in Weak Truth-Table Reducibility , 1991, Notre Dame J. Formal Log..