Enumerability, decidability, computability : an introduction to the theory of recursive functions /
| Autor principal: | Hermes, Hans (Autor, Autor/a) |
|---|---|
| Formato: | Libro |
| Lenguaje: | English |
| Publicado: |
New York :
Oxford University Press,
1985.
|
| Materias: |
Ejemplares similares
-
The undecidable: basic papers on undecidable propositions, unsolvable problems and computable functions /
por: Davis, Martin 1928-
Publicado: (1965) -
Recursively enumerable sets and degress : a study of computable functions and computably generated sets /
por: Soare, Robert Irving 1940-, et al.
Publicado: (1987) -
Algorithms and recursive functions
por: Mal'tsev, Anatolii Ivanovich 1909-1967, et al.
Publicado: (1970) -
Computability : an introduction to recursive function theory /
por: Cutland, Nigel, et al.
Publicado: (1980) -
Algorithms and recursive fuctions /
por: Mal'Cev, A. I.
Publicado: (1970)