Handbook of computability and complexity in analysis
著者
書誌事項
Handbook of computability and complexity in analysis
（Theory and applications of computability）
Springer, c2021
大学図書館所蔵 件 / 全8件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means?
Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology.
This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.
目次
Part I, Computability in Analysis.- Computability of Real Numbers.- Computability of Subsets of Metric Spaces.- Computability of Differential Equations.- Computable Complex Analysis.- Part II, Complexity, Dynamics, and Randomness.- Computable Geometric Complex Analysis and Complex Dynamics.- A Survey on Analog Models of Computation.- Computable Measure Theory and Algorithmic Randomness.- Algorithmic Fractal Dimensions in Geometric Measure Theory.- Part III Constructivity, Logic, and Descriptive Complexity.- Admissibly Represented Spaces and Qcb-Spaces.- Bishop-Style Constructive Reverse Mathematics.- Weihrauch Complexity in Computable Analysis.- Index
「Nielsen BookData」 より