國立虎尾科技大學 |

Handbook of Computability and Complexity in Analysis

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Handbook of Computability and Complexity in Analysis/ edited by Vasco Brattka, Peter Hertling.
其他作者:	Hertling, Peter.
面頁冊數:	XXV, 427 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical Logic and Foundations. -
電子資源:	https://doi.org/10.1007/978-3-030-59234-9
ISBN:	9783030592349

Handbook of Computability and Complexity in Analysis
Handbook of Computability and Complexity in Analysis[electronic resource] /edited by Vasco Brattka, Peter Hertling. - 1st ed. 2021. - XXV, 427 p.online resource. - Theory and Applications of Computability, In cooperation with the association Computability in Europe,2190-619X. - Theory and Applications of Computability, In cooperation with the association Computability in Europe,.

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.

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 comprehensive handbook contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, as well as a wealth of information and references that will help them to navigate the modern research literature in this field. Vasco Brattka is a professor for Theoretical Computer Science and Mathematical Logic at the Universität der Bundeswehr München. He is editor-in-chief of Computability, the journal of the association, Computability in Europe. Peter Hertling is a professor in the Institute for Theoretical Computer Science, Mathematics and Operations Research at UniBwM. He is an associate editor of Journal of Complexity.

ISBN: 9783030592349

Standard No.: 10.1007/978-3-030-59234-9doiSubjects--Topical Terms:

669393
Mathematical Logic and Foundations.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Handbook of Computability and Complexity in Analysis
LDR:03983nam a22004335i 4500 001 1055203
003 DE-He213
005 20210622202504.0
007 cr nn 008mamaa
008 220103s2021 gw | s |||| 0|eng d
020 $a 9783030592349 $9 978-3-030-59234-9
024 7 $a 10.1007/978-3-030-59234-9 $2 doi
035 $a 978-3-030-59234-9
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Handbook of Computability and Complexity in Analysis $h [electronic resource] / $c edited by Vasco Brattka, Peter Hertling.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XXV, 427 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theory and Applications of Computability, In cooperation with the association Computability in Europe, $x 2190-619X
505 0 $a 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.
520 $a 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 comprehensive handbook contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, as well as a wealth of information and references that will help them to navigate the modern research literature in this field. Vasco Brattka is a professor for Theoretical Computer Science and Mathematical Logic at the Universität der Bundeswehr München. He is editor-in-chief of Computability, the journal of the association, Computability in Europe. Peter Hertling is a professor in the Institute for Theoretical Computer Science, Mathematics and Operations Research at UniBwM. He is an associate editor of Journal of Complexity.
650 2 4 $a Mathematical Logic and Foundations. $3 669393
650 2 4 $a Mathematics of Computing. $3 669457
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computers. $3 565115
700 1 $a Hertling, Peter. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1360373
700 1 $a Brattka, Vasco. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1077003
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030592332
776 0 8 $i Printed edition: $z 9783030592356
776 0 8 $i Printed edition: $z 9783030592363
830 0 $a Theory and Applications of Computability, In cooperation with the association Computability in Europe, $x 2190-619X $3 1262393
856 4 0 $u https://doi.org/10.1007/978-3-030-59234-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)