Cargando…
Computability, enumerability, unsolvability: directions in recursion theory
Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.
| Autores principales: | , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Cambridge University Press
1996
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/1619247 |
| Sumario: | Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. |
|---|