Computability, Enumerability, Unsolvability: Directions in Recursion Theory

(Editor) (Editor)
& 1 more

This product is not available in the selected currency.

Descripció

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.

Detalls del producte

Editorial
Cambridge University Press
Data de publicació
Idioma
Anglès
Tipus
Rústica
EAN/UPC
9780521557368
Matèries IBIC:

Obtingues ingressos recomanant llibres

Genera ingressos compartint enllaços dels teus llibres favorits a través del programa d’afiliats.

Uneix-te al programa d’afiliats