Skip to content

Computability, Enumerability, Unsolvability
Stock Photo: Cover May Be Different

Computability, Enumerability, Unsolvability Paperback - 1996

by S. B. Cooper (Editor); T. A. Slaman (Editor); S. S. Wainer (Editor)


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.

Details

  • Title Computability, Enumerability, Unsolvability
  • Author S. B. Cooper (Editor); T. A. Slaman (Editor); S. S. Wainer (Editor)
  • Binding Paperback
  • Edition First Edition
  • Pages 356
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Date 1996-01-11
  • 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
Back to Top

More Copies for Sale

Computability, Enumerability, Unsolvability: Directions in Recursion Theory

Computability, Enumerability, Unsolvability: Directions in Recursion Theory

by Cooper, S.B.; Slaman, T.A.; Wainer, S.S. (editors)

  • Used
  • very good
  • Paperback
Condition
Used - Very Good
Binding
Paperback
ISBN 10 / ISBN 13
9780521557368 / 0521557364
Quantity Available
1
Seller
Corvallis, Oregon, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
A$86.24A$68.99
Save A$17.25!
FREE shipping to USA

Show Details

Description:
Cambridge: Cambridge University Press, 1996. 347 pp. 23 x 15 cm. Textured stiff paper wrappers printed teal and blue. Light wrinkle at head of spine. Light rubbing to extremities. Previous owner's bookplate pasted to inside of front cover. Interior otherwise clean and unmarked. Binding firm with no creases or cracks. . Soft Cover. Very Good.
Item Price
A$86.24A$68.99
Save A$17.25 !
FREE shipping to USA
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Stock Photo: Cover May Be Different

Computability, Enumerability, Unsolvability: Directions in Recursion Theory

by S. B. Cooper; T. A. Slaman; W. S. Wainer, eds

  • Used
  • very good
Condition
Used - very good
ISBN 10 / ISBN 13
9780521557368 / 0521557364
Quantity Available
1
Seller
Berkeley, California, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
A$76.66
A$8.43 shipping to USA

Show Details

Description:
Cambridge University Press, 1996. softcover. very good.
Item Price
A$76.66
A$8.43 shipping to USA
Computability, Enumerability, Unsolvability
Stock Photo: Cover May Be Different

Computability, Enumerability, Unsolvability

by S. B. Cooper

  • New
Condition
New
ISBN 10 / ISBN 13
9780521557368 / 0521557364
Quantity Available
367
Seller
Uxbridge, Greater London, United Kingdom
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
A$99.96
A$15.34 shipping to USA

Show Details

Description:
New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Computability, Enumerability, Unsolvability.
Item Price
A$99.96
A$15.34 shipping to USA
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Stock Photo: Cover May Be Different

Computability, Enumerability, Unsolvability: Directions in Recursion Theory

by Cooper, S. B.; Slaman, T. A.; Wainer, S. S. (eds)

  • Used
  • good
  • Paperback
Condition
Used - Good
Binding
Paperback
ISBN 10 / ISBN 13
9780521557368 / 0521557364
Quantity Available
1
Seller
Corvallis, Oregon, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
A$107.32A$85.86
Save A$21.46!
FREE shipping to USA

Show Details

Description:
Cambridge University Press, 1996. Cover lightly rubbed/soiled, rear flap slightly creased at spine juncture, corners very ligthly rubbed, faintly bumped, spine ends very lightl rubbed, faintly bumped; edges very lightly soiled, fore-edge very lightly bumped; front endpaper has erasures; binding tight; cover, edges, and interior intact and clean except as noted.. paperback. Good.
Item Price
A$107.32A$85.86
Save A$21.46 !
FREE shipping to USA
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical...
Stock Photo: Cover May Be Different

Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series, Series Number 224)

by Cooper, S. B. [Editor]; Slaman, T. A. [Editor]; Wainer, S. S. [Editor];

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 10 / ISBN 13
9780521557368 / 0521557364
Quantity Available
5
Seller
campbelltown, Florida, United States
Seller rating:
This seller has earned a 1 of 5 Stars rating from Biblio customers.
Item Price
A$114.99
A$15.33 shipping to USA

Show Details

Description:
Cambridge University Press. paperback. New. 6x0x9. Brand New Book in Publishers original Sealing
Item Price
A$114.99
A$15.33 shipping to USA
Computability, Enumerability, Unsolvability: Directions in Recursion Theory

Computability, Enumerability, Unsolvability: Directions in Recursion Theory

by S. B. Cooper

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 10 / ISBN 13
9780521557368 / 0521557364
Quantity Available
10
Seller
Southport, Merseyside, United Kingdom
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
A$152.63
A$19.11 shipping to USA

Show Details

Description:
Paperback / softback. New. 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.
Item Price
A$152.63
A$19.11 shipping to USA
Computability, Enumerability, Unsolvability
Stock Photo: Cover May Be Different

Computability, Enumerability, Unsolvability

  • New
Condition
New
ISBN 10 / ISBN 13
9780521557368 / 0521557364
Quantity Available
4
Seller
Woodside, New York, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
A$133.63
A$6.12 shipping to USA

Show Details

Description:
Cambridge University Press CUP , pp. 356 . Papeback. New.
Item Price
A$133.63
A$6.12 shipping to USA
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical...
Stock Photo: Cover May Be Different

Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series)

by Cooper, S. B. [Editor]; Slaman, T. A. [Editor]; Wainer, S. S. [Editor];

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 10 / ISBN 13
9780521557368 / 0521557364
Quantity Available
1
Seller
San Diego, California, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
A$202.64
A$8.36 shipping to USA

Show Details

Description:
Cambridge University Press, 1996-01-26. Paperback. New. New. In shrink wrap. Looks like an interesting title!
Item Price
A$202.64
A$8.36 shipping to USA