Complexity, logic, and recursion theory
著者
書誌事項
Complexity, logic, and recursion theory
（Lecture notes in pure and applied mathematics, v. 187）
Marcel Dekker, c1997
大学図書館所蔵 件 / 全49件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references
内容説明・目次
内容説明
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
目次
- Resource-bounded measure and randomness
- degree structures in local degree theory
- compressibility of infinite binary sequences
- beyond Godel's theorem - the failure to capture information content
- progressions of theories of bounded arithmetic
- on presentations of algebraic structures
- witness-isomorphic reductions and local search
- a survey of inductive inference with an emphasis on queries
- a uniformity of degree structures
- short course on logic, algebra, and topology
- the convenience of Tiling. (Part contents).
「Nielsen BookData」 より
