Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

11 relations
AlgorithmComputable measure theoryComputable numberComputable real function
Expand

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Effective choice and boundedness principles in computable analysis
In this paper we study a new approach to classify mathemat- ical theorems according to their computational content. Basically, we… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Polynomial differential equations compute all real computable functions on computable compact intervals
In the last decade, there have been several attempts to understand the relations between the many models of analog computation… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Computable Analysis
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
Is this relevant?
2005
2005
Continuity and computability of reachable sets
The computation of reachable sets of nonlinear dynamic and control systems is an important problem of systems theory. In this… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Computability on subsets of metric spaces
The notions "recursively enumerable" and "recursive" are the basic notions of effectivity in classical recursion theory. In… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Computable analysis: an introduction
Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament for… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Computable Analysis
  • Klaus Weihrauch
  • Texts in Theoretical Computer Science. An EATCS…
  • 2000
    • Corpus ID: 1336530
Computable Analysis studies those functions on the real numbers and related sets which can be computed by machines such as… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.5
  • figure 2.1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The realizability approach to computable analysis and topology
In this dissertation, I explore aspects of computable analysis and topology in the framework of relative realizability. The… Expand
  • figure 2.1
  • figure 5.1
  • figure 5.2
Is this relevant?
1997
1997
A Foundation for Computable Analysis
While for countable sets there is a single well established computability theory (ordinary recursion theory), Computable Analysis… Expand
Is this relevant?
1989
1989
Horn Programs and Semicomputable Relations on Abstract Structures
 
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE