Picture 1 of 1

Stock photo

Computability: A Mathematical Sketchbook (Graduate Texts in Mathematics, 146), B - Picture 1 of 1

Graduate Texts in Mathematics Ser.: Computability : A Mathematical Sketchbook by Douglas S. Bridges (1994, Hardcover)

Half-Price-Books-Inc (32887)

99% positive feedback

Price:

US $29.44

(inclusive of GST)

ApproximatelyS$ 37.82

+ $23.50 shipping

Estimated delivery Tue, 1 Jul - Thu, 10 Jul

Returns:

30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Good

About this product

Product Identifiers

PublisherSpringer New York

ISBN-100387941746

ISBN-139780387941745

eBay Product ID (ePID)144255

Product Key Features

Number of PagesXi, 180 Pages

Publication NameComputability : a Mathematical Sketchbook

LanguageEnglish

Publication Year1994

SubjectGeneral, Logic

TypeTextbook

AuthorDouglas S. Bridges

Subject AreaMathematics

SeriesGraduate Texts in Mathematics Ser.

FormatHardcover

Dimensions

Item Height0.3 in

Item Weight35.3 Oz

Item Length9.3 in

Item Width6.1 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN93-021313

Dewey Edition20

Series Volume Number146

Number of Volumes1 vol.

IllustratedYes

Dewey Decimal511.3

Table Of ContentPreliminaries.- 1 What Is a Turing Machine'.- 2 Computable Partial Functions.- 3 Effective Enumerations.- 4 Computable Numbers and Functions.- 5 Rice's Theorem and the Recursion Theorem.- 6 Abstract Complexity Theory.- Solutions to Exercises.- Solutions for Chapter 1.- Solutions for Chapter 2.- Solutions for Chapter 3.- Solutions for Chapter 4.- Solutions for Chapter 5.- Solutions for Chapter 6.- References.

SynopsisAimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.

LC Classification NumberQA1-939