Degrees of computability

Abstract

Introduction. In the theory of recursive functions, several decision problems have been proved unsolvable. A decision problem arises when we are confronted with a set TV of mathematical objects and a subset S of 7Y. We desire a mechanical procedure which will operate on elements of TV, determining if they are elements of 5.