The following pages link to (Q3910522):
Displaying 50 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Notes on computable analysis (Q519888) (← links)
- Reflections on function spaces (Q651312) (← links)
- Computability in linear algebra (Q703545) (← links)
- Differential equations in constructive analysis and in the recursive realizability topos (Q793725) (← links)
- Fixed point theory in weak second-order arithmetic (Q922541) (← links)
- On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem (Q1022421) (← links)
- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators (Q1054723) (← links)
- Implication and analysis in classical Frege structures (Q1095139) (← links)
- Compactness in constructive analysis revisited (Q1100202) (← links)
- On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis (Q1102283) (← links)
- A type-free system extending (ZFC) (Q1121865) (← links)
- Constructing best approximations on a Jordan curve (Q1270276) (← links)
- Computability structure of the Sobolev spaces and its applications (Q1292420) (← links)
- On the computability of fractal dimensions and Hausdorff measure (Q1295381) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II (Q1302291) (← links)
- Limiting semantics of numerical programs (Q1392276) (← links)
- A constructive theory of point-set nearness. (Q1427791) (← links)
- Wittgenstein and finitism (Q1583770) (← links)
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval (Q1589441) (← links)
- A Banach-Mazur computable but not Markov computable function on the computable real numbers (Q1765159) (← links)
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not (Q1821332) (← links)
- Apartness spaces as a framework for constructive topology (Q1861535) (← links)
- Formal spaces and their effective presentations (Q1902337) (← links)
- An abstract data type for real numbers (Q1960529) (← links)
- Computable irrational numbers with representations of surprising complexity (Q2216036) (← links)
- On the computability of binary social choice rules in an infinite society and the halting problem (Q2479229) (← links)
- Demuth's path to randomness (Q2795307) (← links)
- Church's thesis without tears (Q3043140) (← links)
- Some Research Problems about Algebraic Differential Equations (Q3314169) (← links)
- Recursivity in Quantum Mechanics (Q3338244) (← links)
- Computability and Noncomputability in Classical Analysis (Q3657990) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q3677726) (← links)
- Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations? (Q3708798) (← links)
- On the complexity of computable real sequences (Q3773335) (← links)
- Derivatives of Computable Functions (Q4210834) (← links)
- Sequential, pointwise, and uniform continuity: A constructive note (Q4304807) (← links)
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras (Q4650302) (← links)
- Constructivity, Computability and Computers in Economic Theory: Some Cautionary Notes (Q4660033) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q4837676) (← links)
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis (Q4916185) (← links)
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach (Q4918008) (← links)
- Complexity of Blowup Problems (Q4918017) (← links)
- On local non‐compactness in recursive mathematics (Q5485484) (← links)
- Specker sequences revisited (Q5693602) (← links)
- The prime number theorem is PRA-provable (Q5941260) (← links)
- Separating notions in effective topology (Q6142834) (← links)
- How much partiality is needed for a theory of computability? (Q6146825) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
