Computability, Enumerability, Unsolvability

出版者:Cambridge University Press

作者:Cooper, S. B.; Slaman, T. A.; Wainer, Stanley S.

页数:356

出版时间:1996-01-26

价格:USD 80.00

装帧:Paperback

isbn号码:9780521557368

丛书系列: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 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.