The Leading eBooks Store Online 4,034,055 members ⚫ 1,328,001 ebooks

New to

Learn more

Computability, Enumerability, Unsolvability

Directions in Recursion Theory

Computability, Enumerability, Unsolvability by S. B. Cooper
Not available
US$ 69.99
(If any tax is payable it will be calculated and shown at checkout.)
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.
Cambridge University Press; Read online
Title: Computability, Enumerability, Unsolvability
Author: S. B. Cooper; T. A. Slaman; S. S. Wainer

This edition is not for sale in your country. Here are some titles that might be what you're after...