Computability, Enumerability, Unsolvability Paperback: Directions in Recursion Theory: 224 (London Mathematical Society Lecture Note Series, Series Number 224) - Tapa blanda

Libro 199 de 387: London Mathematical Society Lecture Notes

Cooper; Slaman; Wainer

 
9780521557368: Computability, Enumerability, Unsolvability Paperback: Directions in Recursion Theory: 224 (London Mathematical Society Lecture Note Series, Series Number 224)

Sinopsis

Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.

"Sinopsis" puede pertenecer a otra edición de este libro.

De la contraportada

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.

"Sobre este título" puede pertenecer a otra edición de este libro.