2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.LO2023
Nearly Computable Real Numbers
Peter Hertling, Philip Janicki
In this article we call a sequence of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function …
cs.LO2016
Two Counterexamples Concerning the Scott Topology on a Partial Order
Peter Hertling
We construct a complete lattice such that the binary supremum function is discontinuous with respect to the product topology on of the Scott t…
math.DS2014★ 2 cited
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
Peter Hertling, Christoph Spandl
Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular th…