Paperback. 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 provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

N� de ref. del art�culo 9780521557368

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Computability, Enumerability, Unsolvability (Paperback)
Editor: Cambridge University Press, Cambridge
Fecha de publicaci�n: 1996
Idioma: Ingl�s
ISBN 10: 0521557364
ISBN 13: 9780521557368
Encuadernaci�n: Paperback
Estado: new

Acerca de

Sinopsis

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

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.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

APOLLO ONLINE CORP.
605 Geddes Street, Wilmington, DE, 19805, U.S.A.

Condiciones de venta y env�o

Condiciones de venta

We guarantee the condition of every book as it�s described on the Abebooks web sites. If you�ve changed
your mind about a book that you�ve ordered, please use the Ask bookseller a question link to contact us
and we�ll respond within 2 business days.
Books ship from California and Michigan.

Condiciones de env�o

Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.

Books ship from California and Michigan.

If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.