×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Computability and Models: Perspectives East and West / Edition 1
     

Computability and Models: Perspectives East and West / Edition 1

by Barry S. Cooper
 

ISBN-10: 030647400X

ISBN-13: 9780306474002

Pub. Date: 01/28/2003

Publisher: Springer US

There are few notions as fundamental to contemporary science as those of computability and modelling. Computability and Models attempts to make some of the exciting and important new research developments in this area accessible to a wider readership. Written by international leaders drawn from major research centres both East and West, this book is an essential

Overview

There are few notions as fundamental to contemporary science as those of computability and modelling. Computability and Models attempts to make some of the exciting and important new research developments in this area accessible to a wider readership. Written by international leaders drawn from major research centres both East and West, this book is an essential addition to scientific libraries serving both specialist and the interested non-specialist reader.

Product Details

ISBN-13:
9780306474002
Publisher:
Springer US
Publication date:
01/28/2003
Series:
University Series in Mathematics
Edition description:
2003
Pages:
375
Product dimensions:
9.21(w) x 6.14(h) x 0.88(d)

Table of Contents

Preface. Contributing Authors. Introduction; P. Odifreddi. Truth-Table Complete Computably Enumerable Sets; M.M. Arslanov. Completeness and Universality of Arithmetical Numbering; S. Badaev, et al. Algebraic Properties of Rogers Semilattices of Arithmetical Numberings; S. Badaev, et al. Isomorphism Types and Theories of Rogers Semilattices of Arithmetical Numberings; S. Badaev, et al. Computability over Topological Structures; V. Brattka. Incomputability In Nature; S.B. Cooper, P. Odifreddi. Gems in the Field of Bounded Queries; W. Gasarch. Finite End Intervals in Definable Quotients of Epsilon; E. Herrmann. A Tour of Robust Learning; S. Jain, F. Stephan. On Primitive Recursive Permutations; I. Kalimullin. On Self-Embeddings of Computable Linear Orders; S. Lempp, et al. Definable Relations on the Computably Enumerable Degrees; A. Li. Quasi-Degrees of Recursively Enumerable Sets; R.Sh. Omanadze. Positive Structures; V. Selivanov. Local Properties of the Non-Total Enumeration Degrees; B. Solon. References.

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews