The following pages link to Peter H. Hertling (Q1868529):
Displaying 50 items.
- (Q184719) (redirect page) (← links)
- A sequentially computable function that is not effectively continuous at any point (Q864424) (← links)
- Effective subsets under homeomorphisms of \(\mathbb{R}^n\) (Q897661) (← links)
- Standard representations of real numbers (Q1125123) (← links)
- Feasible real random access machines (Q1279912) (← links)
- An effective Riemann Mapping Theorem (Q1292405) (← links)
- Random elements in effective topological spaces with measure. (Q1401925) (← links)
- A lower bound for range enclosure in interval arithmetic (Q1603894) (← links)
- Topological properties of real number representations. (Q1607288) (← links)
- A Banach-Mazur computable but not Markov computable function on the computable real numbers (Q1765159) (← links)
- Randomness on full shift spaces (Q1868530) (← links)
- Topological complexity of zero finding with algebraic operations (Q1872637) (← links)
- Small spanning sets of cusp forms (Q1906494) (← links)
- Topological properties of the binary supremum function (Q2153506) (← links)
- On the computational complexity of the range computation problem (Q2215910) (← links)
- Topological complexity with continuous operations (Q2365410) (← links)
- Remarks on the effective Jordan decomposition (Q2699969) (← links)
- Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time (Q2938761) (← links)
- Clarke's generalized gradient and Edalat's L-derivative (Q2987775) (← links)
- Complexity Issues for Preorders on Finite Labeled Forests (Q3091446) (← links)
- Is the Mandelbrot set computable? (Q3159399) (← links)
- (Q3505893) (← links)
- (Q3575432) (← links)
- (Q3837995) (← links)
- (Q3838836) (← links)
- (Q4217598) (← links)
- (Q4219053) (← links)
- A Real Number Structure that is Effectively Categorical (Q4243908) (← links)
- (Q4355686) (← links)
- (Q4381402) (← links)
- (Q4520525) (← links)
- (Q4520529) (← links)
- (Q4520531) (← links)
- (Q4531981) (← links)
- (Q4737223) (← links)
- A Comparison of Certain Representations of Regularly Closed Sets (Q4916184) (← links)
- (Q4938551) (← links)
- (Q4942048) (← links)
- (Q4955604) (← links)
- (Q4982348) (← links)
- EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces (Q5056353) (← links)
- Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations (Q5131653) (← links)
- (Q5310882) (← links)
- (Q5384984) (← links)
- (Q5422235) (← links)
- A limitation for underestimation via twin arithmetic (Q5935459) (← links)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers (Q5941066) (← links)
- Nonlinear Lebesgue and Itô integration problems of high complexity (Q5946395) (← links)
- Nearly computable real numbers (Q6128325) (← links)
- Regainingly approximable numbers and sets (Q6508378) (← links)
