The following pages link to Weihrauch, Klaus (Q162062):
Displaying 50 items.
- (Q585942) (redirect page) (← links)
- Computing Schrödinger propagators on type-2 Turing machines (Q864440) (← links)
- (Q1068560) (redirect page) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)
- Type 2 recursion theory (Q1073021) (← links)
- Theory of representations (Q1073022) (← links)
- Compactness in constructive analysis revisited (Q1100202) (← links)
- Representations of the real numbers and of the open subsets of the set of real numbers (Q1101448) (← links)
- Data representation and computational complexity (Q1132872) (← links)
- Embedding metric spaces into CPO's (Q1164416) (← links)
- On the complexity of online computations of real functions (Q1186506) (← links)
- Program schemata with polynomial bounded counters (Q1216043) (← links)
- On primitive recursive wordfunctions (Q1221752) (← links)
- The computational complexity of program schemata (Q1223162) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- Computability on the probability measures on the Borel sets of the unit interval (Q1292415) (← links)
- Effectiveness of the global modulus of continuity on metric spaces (Q1292416) (← links)
- Random elements in effective topological spaces with measure. (Q1401925) (← links)
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions (Q1575670) (← links)
- Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines (Q1770395) (← links)
- Computability on computable metric spaces (Q1802069) (← links)
- Randomness on full shift spaces (Q1868530) (← links)
- Type 2 computational complexity of functions on Cantor's space (Q2277260) (← links)
- A computable version of the Daniell-Stone theorem on integration and linear functionals (Q2503282) (← links)
- The Arithmetical Hierarchy of Real Numbers (Q2707071) (← links)
- Computably regular topological spaces (Q2846577) (← links)
- Products of effective topological spaces and a uniformly computable Tychonoff Theorem (Q2865068) (← links)
- Representations of measurable sets in computable measure theory (Q2878755) (← links)
- Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$ (Q2878761) (← links)
- Computable Separation in Topology, from T_0 to T_3. (Q2917335) (← links)
- Computability on measurable functions (Q2964280) (← links)
- (Q3075222) (← links)
- Computability of the Radon-Nikodym Derivative (Q3091448) (← links)
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE? (Q3152238) (← links)
- (Q3222178) (← links)
- Computability theory of generalized functions (Q3452499) (← links)
- (Q3518432) (← links)
- (Q3518434) (← links)
- Connectivity properties of dimension level sets (Q3528144) (← links)
- The computational complexity of some julia sets (Q3581268) (← links)
- Absolutely non-computable predicates and functions in analysis (Q3616216) (← links)
- (Q3639066) (← links)
- (Q3639070) (← links)
- (Q3722498) (← links)
- (Q3751553) (← links)
- (Q3861368) (← links)
- (Q3884106) (← links)
- (Q3890679) (← links)
- (Q3914974) (← links)
