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

Book 199 of 387: London Mathematical Society Lecture Notes
 
9780521557368: Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series, Series Number 224)
Softcover
ISBN 10: 0521557364 ISBN 13: 9780521557368
Publisher: Cambridge University Press, 1996

Synopsis

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 provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists.

"synopsis" may belong to another edition of this title.

From the Back Cover

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.

"About this title" may belong to another edition of this title.

Publisher
Cambridge University Press
Publication date
1996
Language
English
ISBN 10 
0521557364
ISBN 13 
9780521557368
Binding
Paperback
Edition number
1
Number of pages
356
Editor
Cooper S. B., Slaman T. A., Wainer S. S.