Computability theory
著者
書誌事項
Computability theory
（Chapman & Hall/CRC mathematics）
Chapman & Hall/CRC, c2004
大学図書館所蔵 件 / 全24件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
この図書・雑誌をさがす
注記
Includes bibliographical references (p. 383-388) and index
内容説明・目次
内容説明
Computability theory originated with the seminal work of Goedel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences.
Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level.
The book includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science.
Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable and lively way.
目次
COMPUTABILITY, AND UNSOLVABLE PROBLEMS: Hilbert and the Origins of Computability Theory. Models of Computability and the Church-Turing Thesis. Language, Proof and Computable Functions. Coding, Self-Reference and Diagonalisation. Enumerability and Computability. The Search for Natural Examples of Incomputable Sets. Comparing Computability. Goedel's Incompleteness Theorem. Decidable and Undecidable Theories. INCOMPUTABILITY AND INFORMATION CONTENT: Computing with Oracles. Nondeterminism, Enumerations and Polynomial Bounds. MORE ADVANCED TOPICS: Post's Problem: Immunity and Priority. The Computability of Theories. Forcing and Category. Applications of Determinacy. Computability and Structure.
「Nielsen BookData」 より