FAQ

Computable analysis

In mathematics and computer science, computable analysis is the study of mathematical analysis from the perspective of computability theory. It is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2017
05101519832017

Related topics

Related topics

11 relations
AlgorithmComputability theoryComputable measure theoryComputable number
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Computable analysis
Algorithm
Numerical analysis
Computer science
Mandelbrot set
Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Computable Analysis Over the Generalized Baire Space
One of the main goals of computable analysis is that of formalizing the complexity of theorems from real analysis. In this… (More)
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 4.1
  • figure 4.2
Is this relevant?
2010
2010
Abstract geometrical computation 5: embedding computable analysis
Extended Signal machines are proven capable to compute any computable function in the understanding of recursive/computable… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2009
2009
A Simple Introduction to Computable Analysis
1 1 Introduction During the last 60 years an extensive theory of computability and computational complexity has been developed… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Effective Choice and Boundedness Principles in Computable Analysis
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2009
2009
Abstract Geometrical Computation and Computable Analysis
Geometrical Computation and 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Computable Analysis and Blaschke Products
We show that if a Blaschke product defines a computable function, then it has a computable sequence of zeros in which the number… (More)
Is this relevant?
2006
2006
The basic feasible functionals in computable analysis
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Computable Analysis
 
Is this relevant?
1999
1999
Index Sets in Computable Analysis
II: classes in a space X where X equals (0, l}“, ww, [O,l], or the real line W are given an effective enumeration P,J and the… (More)
Is this relevant?
1996
1996
Computable Invariance
In Computable Analysis each computable function is continuous and computably invariant , i.e. it maps computable points to… (More)
Is this relevant?