Cargando…
Enumerability · decidability computability: an introduction to the theory of recursive functions
Autor principal: | Hermes, Hans |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
1969
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-3-642-46178-1 http://cds.cern.ch/record/1617676 |
Ejemplares similares
-
Enumerability · decidability computability: an introduction to the theory of recursive functions
por: Hermes, Hans
Publicado: (1965) -
Computability, enumerability, unsolvability: directions in recursion theory
por: Cooper, S Barry, et al.
Publicado: (1996) -
Algebraic computability and enumeration models: recursion theory and descriptive complexity
por: Nourani, Cyrus F
Publicado: (2016) -
Automorphisms of the lattice of recursively enumerable sets
por: Cholak, Peter
Publicado: (1995) -
Role of true finiteness in the admissible recursively enumerable degrees
por: Greenberg, Noam
Publicado: (2006)