Cargando…

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...

Descripción completa

Detalles Bibliográficos
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
Descripción
Sumario: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 mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.
Descripción Física:1 online resource (vii, 347 pages)
Bibliografía:Includes bibliographical references.
ISBN:9781107362390
1107362393
9780511629167
0511629168