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: | |
|---|---|
| Other Authors: | , |
| Format: | Book |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2021
|
| Edition: | 1st ed. 2021 |
| Series: | Computer Science (SpringerNature-11645)
Theory and Applications of Computability, In cooperation with the association Computability in Europe, |
| Subjects: |
Internet
This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.Duke University
| Call Number: |
ISIL:US-NCD |
|---|