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.

Author: S. B. Cooper
Publisher: Cambridge University Press
Published: 01/26/1996
Pages: 356
Binding Type: Paperback
Weight: 1.13lbs
Size: 8.98h x 5.98w x 0.83d
ISBN: 9780521557368

This title is not returnable