24 citations · 64 across the 7 of their papers we have counts for
Showing 2011 · math.LOShow all
2 papers · 2 filters
math.LO2011★ 4 cited
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…
math.LO2011★ 24 cited
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…