《Computability, Enumerability, Unsolvability》是Cambridge University Press出版的圖書，作者是Cooper, S. B.; Slaman, T. A.; Wainer, Stanley S.
基本介紹
- ISBN：9780521557368
- 作者：Cooper, S. B.; Slaman, T. A.; Wainer, Stanley S.
- 出版社：Cambridge University Press
- 出版時間：1996年1月26日
- 頁數：356
- 定價：USD 80.00
- 裝幀：Paperback
- 叢書：London Mathematical Society Lecture Note Series
內容簡介
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 computabl...(展開全部) 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.
