Computability, enumerability, unsolvability : directions in recursion theory /
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure m...
Clasificación: | Libro Electrónico |
---|---|
Otros Autores: | Cooper, S. B. (S. Barry), Slaman, T. A. (Theodore Allen), 1954-, Wainer, S. S. |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Cambridge [England] ; New York :
Cambridge University Press,
1996.
|
Colección: | London Mathematical Society lecture note series ;
224. |
Temas: | |
Acceso en línea: | Texto completo |
Ejemplares similares
-
Computability theory : an introduction to recursion theory /
por: Enderton, Herbert B.
Publicado: (2011) -
Recursion theory for metamathematics /
por: Smullyan, Raymond M.
Publicado: (1993) -
Higher recursion theory /
por: Sacks, Gerald E.
Publicado: (2016) -
General recursion theory : an axiomatic approach /
por: Fenstad, Jens Erik
Publicado: (2016) -
Initial segments of degrees below 0' /
por: Epstein, Richard L., 1947-
Publicado: (1981)