Skip to content

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

Computability, Enumerability, Unsolvability Paperback - 1996

by S. B. Cooper

  • New

Description

New. New Book; Fast Shipping from UK; Not signed; Not First Edition; 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
New
NZ$100.39
NZ$16.73 Shipping to USA
Standard delivery: 7 to 12 days
More Shipping Options
Ships from Ria Christie Collections (Greater London, United Kingdom)

About Ria Christie Collections Greater London, United Kingdom

Biblio member since 2014
Seller rating: This seller has earned a 5 of 5 Stars rating from Biblio customers.

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Ria Christie Collections

Details

  • Title Computability, Enumerability, Unsolvability
  • Author S. B. Cooper
  • Binding Paperback
  • Edition First Edition
  • Condition New
  • Pages 356
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Date 1996-01-26
  • Bookseller's Inventory # ria9780521557368_pod
  • 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.