Recursion Theory and Computational Complexity [electronic resource] / edited by G. Lolli.
Tipo de material:
TextoSeries C.I.M.E. Summer Schools ; 79 | C.I.M.E. Summer Schools ; 79Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Descripción: 236p. 6 illus. online resourceTipo de contenido: - text
- computer
- online resource
- 9783642110726
- SpringerLink (Online service)
- 511.3 23
- QA8.9-10.3
Contenidos:
Springer eBooksResumen: S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.
No hay ítems correspondientes a este registro
S. Homer: Admissible recursion theory -- B.E. Jacobs: Computational complexity and recursion theory -- D. Normann: A survey of set recursion -- G.E. Sacks: Priority arguments in Higgler recursion -- R.I. Soare: Construction in the recursively enumerable degrees -- W. Maass: Recursively invariant recursion theory.
S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.
ZDB-2-SMA
No hay comentarios en este titulo.
Ingresar a su cuenta para colocar un comentario.