Cargando…
Recursion theory: computational aspects of definability
This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion...
Autores principales: | Chong, Chi Tat, Yu, Liang |
---|---|
Lenguaje: | eng |
Publicado: |
De Gruyter
2015
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2050048 |
Ejemplares similares
-
Techniques of admissible recursion theory
por: Chong, Chi-Tat
Publicado: (1984) -
Ordinal definability and recursion theory: the Cabal Seminar
por: Kechris, Alexander S, et al.
Publicado: (2016) -
Recursion Theory and Computational Complexity
por: Lolli, G
Publicado: (2011) -
Theory of recursive functions and effective computability
por: Rogers, Hartley
Publicado: (1967) -
Recursion theory
por: Shoenfield, Joseph R
Publicado: (2017)