000			04016nam a22003975i 4500
999			_c361528 _d361528 _x1
001			361528
003			ES-MaUEC
005			20230102121407.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			210604s2021 gw | s |||| 0|eng d
020			_a9783030592349
024	7		_a10.1007/978-3-030-59234-9 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA9 _b2021 EB
245	0	0	_aHandbook of Computability and Complexity in Analysis _cedited by Vasco Brattka, Peter Hertling
250			_aFirst edition 2021
264		1	_aCham _bSpringer International Publising _c2021
300			_a1 recurso en línea (XXV, 427 páginas)
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aTheory and Applications of Computability In cooperation with the association Computability in Europe _x2190-619X
490	0		_aComputer Science (SpringerNature-11645)
490	0		_aComputer Science (R0) (SpringerNature-43710)
505	0		_aPart 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	3		_aComputable 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.
988			_aSpringer_Computer_2021
650		7	_2embne _9139136 _aLógica matemática
700	1		_aBrattka, Vasco _eeditor literario
700	1		_aHertling, Peter _eeditor literario
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-59234-9 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2022 _dz _eu _zSI