书目名称 | Handbook of Computability and Complexity in Analysis | 编辑 | Vasco Brattka,Peter Hertling | 视频video | | 概述 | Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science.Researchers and graduate students will appreciate the book‘s systematic int | 丛书名称 | Theory and Applications of Computability | 图书封面 |  | 描述 | .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 chapte | 出版日期 | Book 2021 | 关键词 | Computational complexity; Algorithmic randomness; Computability; Domain theory and analysis; Computable | 版次 | 1 | doi | https://doi.org/10.1007/978-3-030-59234-9 | isbn_softcover | 978-3-030-59236-3 | isbn_ebook | 978-3-030-59234-9Series ISSN 2190-619X Series E-ISSN 2190-6203 | issn_series | 2190-619X | copyright | Springer Nature Switzerland AG 2021 |
The information of publication is updating
|
|