Computability, enumerability, unsolvability

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.

שנה

1996

שפה

English

הוצאה

Cambridge University Press

מהדורות

5

עמודים

355

ISBN

9780521557368

מקור הנתונים: Wikidata