Computability and models : perspectives east and west
著者
書誌事項
Computability and models : perspectives east and west
(The University series in mathematics)
Kluwer Academic/Plenum Publishers, c2003
大学図書館所蔵 全10件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
目次
- 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.
「Nielsen BookData」 より