# Theory of Recursive Functions and Effective Computability

@inproceedings{Rogers1969TheoryOR, title={Theory of Recursive Functions and Effective Computability}, author={Jr. Hartley Rogers}, year={1969} }

Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular. A second group of topics has to do with generalizations of recursion theory. The third topics group mentioned is subrecursive computability and subrecursive hierarchies

## 3,382 Citations

### Quasi-Degrees of Recursively Enumerable Sets

- Computer Science
- 2003

The basis of the modern theory of degrees of unsolvability is established in the article by Post [46] in which the notions of many-one (m-) reducibility, truth-table (tt-), bounded truth-table (btt-)…

### Turing Degrees of Isomorphism Types of Geometric Objects

- Mathematics, GeologyComput.
- 2014

Any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds and it is shown that these structures may fail to have a least degree.

### On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings

- Mathematics, Computer ScienceCiE
- 2020

The present paper surveys some results from the inductive inference of recursive functions, which are related to the characterization of inferrible function classes in terms of complexity theory, and…

### BOOLEAN CLASSES OF TURING REDUCTIONS

- Computer Science
- 1986

Criteria are found for the transitivity and reflexivity of the reducibility relation defined by a class of ordered pairs of Boolean functions.

### Bounds in the Turing Reducibility of Functions

- Computer Science, MathematicsMath. Log. Q.
- 1992

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…

### A Précis of Classical Computability Theory

- Computer Science
- 2014

This chapter introduces basic notions and results of Turing machines and readers already familiar with them can safely skip it.

### Degrees of Total Algorithms versus Degrees of Honest Functions

- MathematicsCiE
- 2012

A few theorems are proved elucidating the relationship between to different approaches to subrecursive degree theory and their roots in the theory of algorithms and Turing degrees.