65,45 €*
Versandkostenfrei per Post / DHL
Lieferzeit 4-7 Werktage
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.
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.
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 introductions into many branches of computable analysis
Dedicated to Klaus Weihrauch, the leading pioneer and teacher in this domain
Further domain information available at [...]
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
Erscheinungsjahr: | 2022 |
---|---|
Genre: | Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Reihe: | Theory and Applications of Computability |
Inhalt: |
xxv
427 S. |
ISBN-13: | 9783030592363 |
ISBN-10: | 3030592367 |
Sprache: | Englisch |
Ausstattung / Beilage: | Paperback |
Einband: | Kartoniert / Broschiert |
Redaktion: |
Hertling, Peter
Brattka, Vasco |
Herausgeber: | Vasco Brattka/Peter Hertling |
Auflage: | 1st ed. 2021 |
Hersteller: |
Springer International Publishing
Theory and Applications of Computability |
Maße: | 235 x 155 x 23 mm |
Von/Mit: | Peter Hertling (u. a.) |
Erscheinungsdatum: | 06.06.2022 |
Gewicht: | 0,769 kg |
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 introductions into many branches of computable analysis
Dedicated to Klaus Weihrauch, the leading pioneer and teacher in this domain
Further domain information available at [...]
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
Erscheinungsjahr: | 2022 |
---|---|
Genre: | Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Reihe: | Theory and Applications of Computability |
Inhalt: |
xxv
427 S. |
ISBN-13: | 9783030592363 |
ISBN-10: | 3030592367 |
Sprache: | Englisch |
Ausstattung / Beilage: | Paperback |
Einband: | Kartoniert / Broschiert |
Redaktion: |
Hertling, Peter
Brattka, Vasco |
Herausgeber: | Vasco Brattka/Peter Hertling |
Auflage: | 1st ed. 2021 |
Hersteller: |
Springer International Publishing
Theory and Applications of Computability |
Maße: | 235 x 155 x 23 mm |
Von/Mit: | Peter Hertling (u. a.) |
Erscheinungsdatum: | 06.06.2022 |
Gewicht: | 0,769 kg |