Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,060,653 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
Characterization of semicomputable sets, and computable partial functions,on the real plane
M. Fu
2014
Corpus ID: 118477259
This thesis is composed of two related projects: (1) Characterizations of semicomputable subsets of R as unions of effective…
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
2012
2012
2005 Summer Meeting of the Association for Symbolic Logic Logic Colloquium '05 Abstracts of Invited Plenary Talks Abstract of Invited Talk in the Short Course on Computer Science Logic
C. Parsons
,
P. Bernays
2012
Corpus ID: 13902187
s of invited plenary talks ◮ JAN A. BERGSTRA, INGE BETHKE, AND ALBAN PONSE, Decision problems for pushdown threads. Department of…
Expand
Review
2008
Review
2008
A Software Library for Reliable Online-Arithmetic with Rational Numbers
G. Casado
,
J. Chamizo
Numerical Validation in Current Hardware…
2008
Corpus ID: 12550428
An overview of a novel calculation framework for scientific computing in integrable spaces is introduced. This paper discusses…
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
2007
2007
Admissible Domain Representations of Inductive Limit Spaces
F. Dahlgren
2007
Corpus ID: 18207272
In this thesis we introduce and study a notion of effectivity (or computability) for test functions and for distributions. This…
Expand
2003
2003
Computability via analog circuits
D. Graça
2003
Corpus ID: 1845875
In this paper we are interested in a particular model of analog computation, the General Purpose Analog Computer (GPAC). In…
Expand
2003
2003
The Inversion Problem for Computable Linear Operators
V. Brattka
Symposium on Theoretical Aspects of Computer…
2003
Corpus ID: 6098069
Given a program of a linear bounded and bijective operator T, does there exist a program for the inverse operator T-1? And if…
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