Handbook of computability and complexity in analysis [electronic resource] / Vasco Brattka, Peter Hertling, editors.
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...
Saved in:
Online Access: |
Full Text (via Springer) |
---|---|
Other Authors: | , |
Format: | Electronic eBook |
Language: | English |
Published: |
Cham, Switzerland :
Springer,
2020.
|
Series: | Theory and applications of computability.
|
Subjects: |
Internet
Full Text (via Springer)Online
Call Number: |
QA9.59
|
---|---|
QA9.59 | Available |