Summary and Info
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.
Review and Comments
Rate the Book
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series) 0 out of 5 stars based on 0 ratings.