• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computability, Enumerability, Unsolvability

Computability, Enumerability, Unsolvability

Paperback

Series: London Mathematical Society Lecture Note, Book 224

Fiction

ISBN10: 0521557364
ISBN13: 9780521557368
Publisher: Cambridge University Press
Published: Jan 11 1996
Pages: 356
Weight: 1.13
Height: 0.83 Width: 5.98 Depth: 8.98
Language: English
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.

Also in

Fiction