Computability, Enumerability, Unsolvability: Directions in Recursion Theory - Couverture souple

Cooper, S

Couverture souple

ISBN 10 : 0521557364 ISBN 13 : 9780521557368

Editeur : Cambridge University Press, 2009

Synopsis

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

A propos du livre

Présentation de l'éditeur

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.

Détails de l'édition

• Éditeur: Cambridge University Press
• Date d'édition: 2009
• Langue: anglais
• ISBN 10: 0521557364
• ISBN 13: 9780521557368
• Reliure: Broché
• Nombre de pages: 356
• Coordonnées du fabricant: non disponible
• Personne responsable: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; France