computable analysis
≈ 3 min read
Names in other languages
- eokomputebla analitiko
- Englishcomputable analysis
- Españolanálisis computable
- Françaisanalyse calculable
- Portuguêsanálise computável
- 日本語計算可能解析学
- 中文可計算性分析
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics and computer science, computable analysis is the study of mathematical analysis from the perspective of computability theory. It is concerned with the parts of real analysis and functional analysis that can be carried out in a computable manner. The field is closely related to constructive analysis and numerical analysis. A notable result is that integration (in the sense of the Riemann integral) is computable. This might be considered surprising as an integral is (loosely speaking) an infinite sum.
While this result could be explained by the fact that every computable function from \mathbb [0,1] to \mathbb R is uniformly continuous, the notable thing is that the modulus of continuity can always be computed without being explicitly given. A similarly surprising fact is that differentiation of complex functions is also computable, while the same result is false for real functions. The above motivating results have no counterpart in Bishop's constructive analysis.
Instead, it is the stronger form of constructive analysis developed by Brouwer that provides a counterpart in constructive logic.
Evidence and sources
In mathematics and computer science, computable analysis is the study of mathematical analysis from the perspective of computability theory. It is concerned with the parts of real analysis and functional analysis that can be carried out in a computable manner. The field is closely related to constructive analysis and numerical analysis. A notable result is that integration (in the sense of the Riemann integral) is computable. This might be considered surprising as an integral is (loosely speaking) an infinite sum.
While this result could be explained by the fact that every computable function from \mathbb [0,1] to \mathbb R is uniformly continuous, the notable thing is that the modulus of continuity can always be computed without being explicitly given. A similarly surprising fact is that differentiation of complex functions is also computable, while the same result is false for real functions. The above motivating results have no counterpart in Bishop's constructive analysis.
Instead, it is the stronger form of constructive analysis developed by Brouwer that provides a counterpart in constructive logic. To understand why decimal notation is inappropriate, consider the problem of computing z=x+y where x = 0.(3) and y=0.(6) , and giving the result z in decimal notation. The value of z is either 0.(9) or 1.(0) .
If the latter result were given for instance, then a finite number n of digits of x would be read before choosing the digit 1 before the decimal point in z , but then, if the (n+1) st digit of x were decreased to 2, then the result for z would be wrong. Similarly, the former choice 0.(9) for z would be wrong sometimes. This is essentially the tablemaker's dilemma. As well as signed digits, there are analogues of Cauchy sequences and Dedekind cuts that could in principle be used instead.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1368992915 under CC BY-SA 4.0; modifications have been made.