Limone Time
Computability, enumerability, unsolvability

Computability, enumerability, unsolvability

Book (1996)

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.

Genres
Recursion theory, Recursivité, Théorie de la, COMPUTERS, Machine Theory, Rekursionstheorie, Aufsatzsammlung
Author
S. B. Cooper
Pages
355

Where to find it

Amazon ↗

Some links are affiliate links: if you buy, the site may receive a commission at no extra cost to you.

Can't decide?

Tell me what you like and I will suggest what to read for you.

Try it for free

Similar titles

Generalized recursion theory (1974)Recursion theory (1993)Bounded queries in recursion theory (1998)Aspects of incompleteness (1997)How to Think About Algorithms (2008)Fundamentals of mathematical logic (2005)Computability theory (2010)Higher recursion theory (1990)