The following pages link to Vasco Brattka (Q408154):
Displaying 50 items.
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma (Q408156) (← links)
- Closed choice and a uniform low basis theorem (Q424541) (← links)
- Addendum to: ``The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma'' (Q529168) (← links)
- Computability of finite-dimensional linear subspaces and best approximation (Q638485) (← links)
- Computability in linear algebra (Q703545) (← links)
- Towards computability of elliptic boundary value problems in variational formulation (Q864435) (← links)
- Borel complexity and computability of the Hahn-Banach theorem (Q926175) (← links)
- A computable version of Banach's inverse mapping theorem (Q1006604) (← links)
- Computable invariance (Q1274805) (← links)
- Feasible real random access machines (Q1279912) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
- Recursive quasi-metric spaces. (Q1427771) (← links)
- Computability on subsets of metric spaces. (Q1427773) (← links)
- Topological properties of real number representations. (Q1607288) (← links)
- On the uniform computational content of the Baire category theorem (Q1633900) (← links)
- On the uniform computational content of computability theory (Q1694010) (← links)
- Generated quasi-metric hyper and function spaces. (Q1868863) (← links)
- Completion of choice (Q2220486) (← links)
- Probabilistic computability and choice (Q2346414) (← links)
- Realistic models of computability on the real numbers (Q2742630) (← links)
- On the Computational Content of the Brouwer Fixed Point Theorem (Q2904393) (← links)
- Weihrauch degrees, omniscience principles and weak computability (Q2917341) (← links)
- Effective choice and boundedness principles in computable analysis (Q2917342) (← links)
- Las Vegas Computability and Algorithmic Randomness (Q2954989) (← links)
- The Vitali Covering Theorem in the Weihrauch Lattice (Q2970958) (← links)
- Weihrauch degrees, omniscience principles and weak computability (Q3083132) (← links)
- Effective Choice and Boundedness Principles in Computable Analysis (Q3083466) (← links)
- Effective Borel measurability and reducibility of functions (Q3159400) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- The Brouwer Fixed Point Theorem Revisited (Q3188240) (← links)
- Randomness and differentiability (Q3448999) (← links)
- (Q3505880) (← links)
- (Q3508019) (← links)
- Borel Complexity of Topological Operations on Computable Metric Spaces (Q3611721) (← links)
- Plottable Real Number Functions and the Computable Graph Theorem (Q3614160) (← links)
- (Q4218420) (← links)
- (Q4249367) (← links)
- Order-free Recursion on the Real Numbers (Q4336701) (← links)
- (Q4364584) (← links)
- (Q4418667) (← links)
- (Q4472015) (← links)
- (Q4503952) (← links)
- (Q4532000) (← links)
- (Q4546073) (← links)
- On the algebraic structure of Weihrauch degrees (Q4553287) (← links)
- (Q4585068) (← links)
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM (Q4600456) (← links)
- Monte Carlo Computability (Q4636615) (← links)
- Approaches to Effective Semi‐Continuity of Real Functions (Q4704654) (← links)
