Cargando…
Recursion Theory and Computational Complexity
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 recursio...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
2011
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/978-3-642-11072-6 http://cds.cern.ch/record/1414155 |