Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series) - Softcover

Cooper, S

Softcover

ISBN 10: 0521557364 ISBN 13: 9780521557368

Verlag: Cambridge University Press, 2009

Inhaltsangabe

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

Über diesen Titel

Von der hinteren Coverseite

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.

Details zur Ausgabe

• Verlag: Cambridge University Press
• Erscheinungsdatum: 2009
• Sprache: Englisch
• ISBN 10: 0521557364
• ISBN 13: 9780521557368
• Einband: Taschenbuch
• Auflage: 1
• Anzahl der Seiten: 356
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Frankreich