Handbook of computability and complexity in analysis /
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...
Corporate Author: | SpringerLink (Online service) |
---|---|
Other Authors: | Brattka, Vasco (Editor, http://id.loc.gov/vocabulary/relators/edt), Brattka, Vasco, 1966- (Editor), Hertling, Peter (Editor, http://id.loc.gov/vocabulary/relators/edt), Hertling, Peter, 1965- (Editor) |
Format: | Book |
Language: | English |
Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2021
Cham, Switzerland : Springer, [2021] |
Edition: | 1st ed. 2021 |
Series: | Computer Science (SpringerNature-11645)
Theory and Applications of Computability, In cooperation with the association Computability in Europe, Theory and applications of computability |
Subjects: |
Similar Items
-
Turing Computability Theory and Applications /
by: Soare, Robert I
Published: (2016) -
Turing Computability : Theory and Applications /
by: Soare, R. I (Robert Irving), 1940-, et al.
Published: (2016) -
Complexity and Real Computation
by: Blum, Lenore, et al.
Published: (1998) -
The Incomputable Journeys Beyond the Turing Barrier /
Published: (2017) -
The Incomputable : Journeys Beyond the Turing Barrier /
Published: (2017)