Limone Time
Computability, enumerability, unsolvability

Computability, enumerability, unsolvability

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

Géneros
Recursion theory, Recursivité, Théorie de la, COMPUTERS, Machine Theory, Rekursionstheorie, Aufsatzsammlung
Autor
S. B. Cooper
Páginas
355

Dónde encontrarlo

Amazon ↗

Algunos enlaces son de afiliación: si compras, el sitio puede recibir una comisión, sin coste adicional para ti.

¿No sabes qué elegir?

Dime lo que te gusta y te propongo qué leer según tus gustos.

Pruébalo gratis

Títulos parecidos

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)