chapter
26 Pages

Degree Structures in Local Degree Theory

WithMarat Arslanov

Computable functions are the fundamental objects of recursion theory. A function f from ω to ω is computable if it can be calculated by some program on a Turing machine.