Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,023,922 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.
Review
2017
Review
2017
Weihrauch Complexity in Computable Analysis
V. Brattka
,
G. Gherardi
,
A. Pauly
Theory and Applications of Computability
2017
Corpus ID: 7903709
We provide a self-contained introduction into Weihrauch complexity and its applications to computable analysis. This includes a…
Expand
Highly Cited
2014
Highly Cited
2014
Computable Analysis: An Introduction
K. Weihrauch
Texts in Theoretical Computer Science. An EATCS…
2014
Corpus ID: 1336530
Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament for…
Expand
Highly Cited
2011
Highly Cited
2011
The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma
V. Brattka
,
G. Gherardi
,
Alberto Marcone
Annals of Pure and Applied Logic
2011
Corpus ID: 14945410
Highly Cited
2009
Highly Cited
2009
Effective Choice and Boundedness Principles in Computable Analysis
V. Brattka
,
G. Gherardi
Bulletin of Symbolic Logic
2009
Corpus ID: 5619046
Abstract In this paper we study a new approach to classify mathematical theorems according to their computational content…
Expand
Highly Cited
2007
Highly Cited
2007
Polynomial differential equations compute all real computable functions on computable compact intervals
Olivier Bournez
,
M. Campagnolo
,
D. Graça
,
Emmanuel Hainry
Journal of Complexity
2007
Corpus ID: 322039
Highly Cited
2005
Highly Cited
2005
Computable Analysis
K. Weihrauch
Conference on Computability in Europe
2005
Corpus ID: 36786537
One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain…
Expand
Highly Cited
2005
Highly Cited
2005
Continuity and computability of reachable sets
Pieter Collins
Theoretical Computer Science
2005
Corpus ID: 8310192
Highly Cited
2003
Highly Cited
2003
Computability on subsets of metric spaces
V. Brattka
,
G. Presser
Theoretical Computer Science
2003
Corpus ID: 34069417
Highly Cited
2000
Highly Cited
2000
The realizability approach to computable analysis and topology
A. Bauer
,
D. Scott
2000
Corpus ID: 117208981
In this dissertation, I explore aspects of computable analysis and topology in the framework of relative realizability. The…
Expand
Highly Cited
1985
Highly Cited
1985
Type 2 Recursion Theory
K. Weihrauch
Theoretical Computer Science
1985
Corpus ID: 19276166
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