论文信息 - Degrees of computability

Degrees of computability

Abstract : An investigation is made of the degrees of computability (in the theoretical sense) of certain decision problems. The Kleene hierarchy is extended to partial relations. (Author)

Norman Shapiro | N. Shapiro

[1] Emil L. Post. Recursively enumerable sets of positive integers and their decision problems , 1944 .

[2] H. Rice. Classes of recursively enumerable sets and their decision problems , 1953 .

[3] L. E. Dickson. Introduction to the theory of numbers , 1933 .

[4] Alan M. Turing,et al. Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

[5] A. Church. The calculi of lambda-conversion , 1941 .

[6] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .

[7] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .

[8] H. G. Rice,et al. Recursive real numbers , 1954 .

[9] A. Church. An Unsolvable Problem of Elementary Number Theory , 1936 .

[10] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .

[11] W. Markwald. Zur Theorie der konstruktiven Wohlordnungen , 1954 .