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

Cooper, S

ISBN 10: 0521557364 / ISBN 13: 9780521557368

Published by Cambridge University Press, 1996

About this Item

Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. Editor(s): Cooper, S. B.; etc.; Slaman, T. A. (University of Chicago); Wainer, S. S. (University of Leeds). Series: London Mathematical Society Lecture Note Series. Num Pages: 356 pages, Illustrations. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 20. Weight in Grams: 507. . 1996. paperback. . . . .

Seller Inventory # V9780521557368

Bibliographic Details

• Title: Computability, Enumerability, Unsolvability: Directions in Recursion Theory: 224 (London Mathematical Society Lecture Note Series, Series Number 224)
• Publisher: Cambridge University Press
• Publication Date: 1996
• Language: English
• ISBN 10: 0521557364
• ISBN 13: 9780521557368
• Binding: Soft cover
• Condition: New

About this title

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.

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.