Skip to content

Computability Theory
Stock Photo: Cover May Be Different

Computability Theory Hardback - 2003 - 1st Edition

by S. Barry Cooper

  • New
  • Hardcover

Description

Hardback. New. Offers an introduction to contemporary computability theory, techniques, and results. This book places the basic concepts and techniques of computability theory in their historical, philosophical and logical context. It includes a chapter that explores a variety of computability applications to mathematics and science.
New
NZ$202.55
NZ$20.86 Shipping to USA
Standard delivery: 14 to 21 days
More Shipping Options
Ships from The Saint Bookstore (Merseyside, United Kingdom)

About The Saint Bookstore Merseyside, United Kingdom

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

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Details

  • Title Computability Theory
  • Author S. Barry Cooper
  • Binding Hardback
  • Edition number 1st
  • Edition 1
  • Condition New
  • Pages 420
  • Volumes 1
  • Language ENG
  • Publisher CRC Press, Boca Raton, Florida
  • Date 2003-11-17
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index
  • Bookseller's Inventory # A9781584882374
  • ISBN 9781584882374 / 1584882379
  • Weight 1.58 lbs (0.72 kg)
  • Dimensions 9.7 x 6.22 x 1.08 in (24.64 x 15.80 x 2.74 cm)
  • Library of Congress subjects Computable functions
  • Library of Congress Catalog Number 2003055823
  • Dewey Decimal Code 511.3

From the publisher

Computability theory originated with the seminal work of Gdel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences.

Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level.

The book includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science.

Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable and lively way.

First line

It is only in the last century that computability became both a driving force in our daily lives and a concept one could talk about with any sort of precision.

Categories