Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,788,148 papers from all fields of science
Search
Sign In
Create Free Account
Computable analysis
In mathematics and computer science, computable analysis is the study of mathematical analysis from the perspective of computability theory. It is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Algorithm
Computable measure theory
Computable number
Computable real function
Expand
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Computable versions of the uniform boundedness theorem
V. Brattka
,
Z. Chatzidakis
,
P. Koepke
,
W. Pohlers
2016
Corpus ID: 14091278
We investigate the computable content of the Uniform Boundedness Theorem and of the closely related Banach-Steinhaus Theorem. The…
Expand
2014
2014
Computability and Complexity over the Product Topology of Real Numbers
Walid Gomaa
arXiv.org
2014
Corpus ID: 628006
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over "large…
Expand
2008
2008
On the computability of binary social choice rules in an infinite society and the halting problem
Yasuhito Tanaka
Applied Mathematics and Computation
2008
Corpus ID: 2213854
2007
2007
Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society
Yasuhito Tanaka
Applied Mathematics and Computation
2007
Corpus ID: 18276515
2007
2007
The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis
M. Korovina
,
O. Kudinov
Conference on Computability in Europe
2007
Corpus ID: 10422909
In this paper we prove the Uniformity Principle for Σ---definability over the real numbers extended by open predicates. Using…
Expand
2005
2005
Investigation of Emotive Expressions of Spoken Sentences
Wenjie Cao
,
Chengqing Zong
,
Bo Xu
Affective Computing and Intelligent Interaction
2005
Corpus ID: 4052468
When we meet a emotion keyword in a sentence that expresses a kind of emotion, or a word that does not directly express emotion…
Expand
2003
2003
On the Effective Jordan Decomposability
Xizhong Zheng
,
Robert Rettinger
,
Burchard von Braunmühl
Symposium on Theoretical Aspects of Computer…
2003
Corpus ID: 15418508
The classical Jordan decomposition Theorem says that any real function of bounded variation can be expressed as a difference of…
Expand
2000
2000
Computational Dimension of Topological Spaces
H. Tsuiki
International Conference on Computability and…
2000
Corpus ID: 2457142
When a topological space X can be embedded into the space ?;?,n? of n?-sequences of ?, then we can define the corresponding…
Expand
1998
1998
Point-Free Topological Spaces, Functions and Recursive Points: Filter Foundation for Recursive Analysis I
I. Kalantari
,
L. Welch
Annals of Pure and Applied Logic
1998
Corpus ID: 12090222
1983
1983
Recursivity in quantum mechanics
J. Baez
1983
Corpus ID: 16908379
The techniques of effective descriptive set theory are applied to the mathematical formalism of quantum mechanics in order to see…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE