Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 456 pp. Englisch. Codice articolo 9783030592363

Contatta il venditore

Compra nuovo

EUR 74,89

Convertire valuta

Spese di spedizione: EUR 23,00

Da: Germania a: U.S.A.

Destinazione, tempi e costi

Quantit�: 2 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Handbook of Computability and Complexity in Analysis

Brattka, Vasco (EDT); Hertling, Peter (EDT)

Editore: Springer, 2022

ISBN 10: 3030592367 ISBN 13: 9783030592363

Nuovo Brossura

Da: GreatBookPrices, Columbia, MD, U.S.A.

Valutazione del venditore 5 su 5 stelle

Condizione: New. Codice articolo 44799426-n

Contatta il venditore

Compra nuovo

EUR 99,86

Convertire valuta

Spese di spedizione: EUR 2,36

In U.S.A.

Destinazione, tempi e costi

Quantit�: Pi� di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Handbook of Computability and Complexity in Analysis

Peter Hertling

Editore: Springer International Publishing, 2022

ISBN 10: 3030592367 ISBN 13: 9783030592363

Nuovo Taschenbuch

Da: AHA-BUCH GmbH, Einbeck, Germania

Valutazione del venditore 5 su 5 stelle

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783030592363

Contatta il venditore

Compra nuovo

EUR 74,89

Convertire valuta

Spese di spedizione: EUR 31,84

Da: Germania a: U.S.A.

Destinazione, tempi e costi

Quantit�: 1 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Handbook of Computability and Complexity in Analysis

Brattka, Vasco (EDT); Hertling, Peter (EDT)

Editore: Springer, 2022

ISBN 10: 3030592367 ISBN 13: 9783030592363

Nuovo Brossura

Da: GreatBookPricesUK, Woodford Green, Regno Unito

Valutazione del venditore 5 su 5 stelle

Condizione: New. Codice articolo 44799426-n

Contatta il venditore

Compra nuovo

EUR 91,23

Convertire valuta

Spese di spedizione: EUR 17,84

Da: Regno Unito a: U.S.A.

Destinazione, tempi e costi

Quantit�: Pi� di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Handbook of Computability and Complexity in Analysis

Editore: Springer, Berlin|Springer International Publishing|Springer, 2022

ISBN 10: 3030592367 ISBN 13: 9783030592363

Nuovo Brossura

Print on Demand

Da: moluna, Greven, Germania

Valutazione del venditore 5 su 5 stelle

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 mat. Codice articolo 600115897

Contatta il venditore