Skip to search formSkip to main contentSkip to account menu

Computable analysis

In mathematics and computer science, computable analysis is the study of mathematical analysis from the perspective of computability theory. It is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We investigate the computable content of the Uniform Boundedness Theorem and of the closely related Banach-Steinhaus Theorem. The… 
2014
2014
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over "large… 
2007
2007
In this paper we prove the Uniformity Principle for Σ---definability over the real numbers extended by open predicates. Using… 
2005
2005
When we meet a emotion keyword in a sentence that expresses a kind of emotion, or a word that does not directly express emotion… 
2003
2003
The classical Jordan decomposition Theorem says that any real function of bounded variation can be expressed as a difference of… 
2000
2000
When a topological space X can be embedded into the space ?;?,n? of n?-sequences of ?, then we can define the corresponding… 
1983
1983
The techniques of effective descriptive set theory are applied to the mathematical formalism of quantum mechanics in order to see…