10 citations · 10 across the 1 of their papers we have counts for
4 papers
Products of effective topological spaces and a uniformly computable Tychonoff Theorem
Robert Rettinger, Klaus Weihrauch
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of eff…
Point-Separable Classes of Simple Computable Planar Curves
Xizhong Zheng, Robert Rettinger
In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-di…
On computable approximations of Landau's constant
Robert Rettinger
We present an algorithm which computes the Landau constant up to any given precision.
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)
Robert Rettinger
We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we…