Logo - springer
Slogan - springer

Mathematics | Computability and Models - Perspectives East and West

Computability and Models

Perspectives East and West

Cooper, Barry S., Goncharov, Sergey (Eds.)

2003, XIX, 375 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$149.00

(net) price for USA

ISBN 978-1-4615-0755-0

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$199.00

(net) price for USA

ISBN 978-0-306-47400-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$189.00

(net) price for USA

ISBN 978-1-4613-5225-9

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • About this book

Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com­ putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network.

Content Level » Research

Keywords » Arithmetic - Division - Permutation - addition - computability - modeling

Related subjects » Mathematics - Philosophy - Theoretical Computer Science

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.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Foundations.