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...
| Other Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cham, Switzerland :
Springer,
2020
|
| Series: | Theory and applications of computability,
|
| Subjects: |
Internet
This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.Stanford University
| Call Number: |
ISIL:US-CST |
|---|