Theory of Recursive Functions and Effective Computability.

@inproceedings{Rogers1969TheoryOR,
  title={Theory of Recursive Functions and Effective Computability.},
  author={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 

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 1,472 CITATIONS

Computable elements and functions in effectively enumerable topological spaces

  • Mathematical Structures in Computer Science
  • 2017
VIEW 11 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On the logical semantics of the symmetric constructive logic based on the properties of recursively enumerable sets

  • Ninth International Conference on Computer Science and Information Technologies Revised Selected Papers
  • 2013
VIEW 17 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Mass problems and measure-theoretic regularity

  • Bulletin of Symbolic Logic
  • 2009
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Almost everywhere domination and superhighness

  • Math. Log. Q.
  • 2007
VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Learning Correction Grammars

VIEW 14 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Mass Problems and Hyperarithmeticity

  • J. Mathematical Logic
  • 2007
VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Mass problems and randomness

  • Bulletin of Symbolic Logic
  • 2005
VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1968
2019

CITATION STATISTICS

  • 209 Highly Influenced Citations

  • Averaged 34 Citations per year from 2017 through 2019