![Computability, Enumerability, Unsolvability: Directions in Recursion Theory](https://d3525k1ryd2155.cloudfront.net/f/368/557/9780521557368.IN.0.m.jpg)
Stock Photo: Cover May Be Different
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series) Paperback - 1996
by Cooper, S. B. [Editor]; Slaman, T. A. [Editor]; Wainer, S. S. [Editor];
- New
- Paperback
Description
New
NZ$218.85
NZ$9.02
Shipping to USA
Standard delivery: 2 to 21 days
More Shipping Options
Standard delivery: 2 to 21 days
Ships from GridFreed LLC (California, United States)
About GridFreed LLC California, United States
Biblio member since 2021
We sell primarily non-fiction, many new books, some collectible first editions and signed books. We operate 100% online and have been in business since 2005.
Details
- Title Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series)
- Author Cooper, S. B. [Editor]; Slaman, T. A. [Editor]; Wainer, S. S. [Editor];
- Binding Paperback
- Edition First Edition
- Condition New
- Pages 356
- Volumes 1
- Language ENG
- Publisher Cambridge University Press
- Date 1996-01-26
- Bookseller's Inventory # Q-0521557364
- ISBN 9780521557368 / 0521557364
- Weight 1.13 lbs (0.51 kg)
- Dimensions 8.98 x 5.98 x 0.83 in (22.81 x 15.19 x 2.11 cm)
- Library of Congress subjects Recursion theory
- Library of Congress Catalog Number 95044750
- Dewey Decimal Code 511.35
First line
HASH(0x10abb120)
From the rear cover
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, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.