24 citations · 64 across the 7 of their papers we have counts for
5 papers · 1 filter
Intersection points of planar curves can be computed
Klaus Weihrauch
Consider two paths in the unit square such that , , and . By continuity of and there is a point of i…
Computably regular topological spaces
Klaus Weihrauch
This article continues the study of computable elementary topology started by the author and T. Grubba in 2009 and extends the author's 2010 study of axioms of computable separatio…
Computability of the Radon-Nikodym derivative
Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch
We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable mea…
Turing machines on represented sets, a model of computation for Analysis
Nazanin Tavana, Klaus Weihrauch
We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis. In a single tape cell a GTM…
Randomness extraction and asymptotic Hamming distance
Cameron E. Freer, Bjoern Kjos-Hanssen
We obtain a non-implication result in the Medvedev degrees by studying sequences that are close to Martin-Löf random in asymptotic Hamming distance. Our result is that the class of…