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.

Book Information
ISBN 9780521557368
Author S. B. Cooper
Format Paperback
Page Count 356
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 520g