Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,084,879 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.
2015
2015
Towards the Effective Descriptive Set Theory
V. Selivanov
Conference on Computability in Europe
2015
Corpus ID: 37459561
We prove effective versions of some classical results about measurable functions and derive from this extensions of the Suslin…
Expand
2010
2010
Computability of Countable Subshifts
D. Cenzer
,
S. Dashti
,
Ferit Toska
,
Sebastian Wyman
Conference on Computability in Europe
2010
Corpus ID: 6015505
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor…
Expand
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
Computability of compact operators on computable Banach spaces with bases
V. Brattka
,
Ruth Dillhage
Mathematical Logic Quarterly
2007
Corpus ID: 43540641
We develop some parts of the theory of compact operators from the point of view of computable analysis. While computable compact…
Expand
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
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
1995
1995
Constructive mathematics and unbounded operators — A reply to Hellman
D. Bridges
Journal of Philosophical Logic
1995
Corpus ID: 12234724
It is argued that Hellman's arguments purporting to demonstrate that constructive mathematics cannot cope with unbounded…
Expand
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