Computability, Enumerability, Unsolvability: Directions In Recursion Theory (london Mathematical Society Lecture Note Series)
by S. B. Cooper /
1996 / English / PDF
5.9 MB Download
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.
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.
