Computability, Enumerability, Unsolvability
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.
Product details
January 1996Paperback
9780521557368
356 pages
228 × 152 × 21 mm
0.507kg
Available