scientific article; zbMATH DE number 3720907
From MaRDI portal
Publication:3910522
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Constructive and recursive analysis (03F60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to real functions (26-01) Software, source code, etc. for problems pertaining to real functions (26-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to functions of a complex variable (30-01) Software, source code, etc. for problems pertaining to functions of a complex variable (30-04)
Cited in
(52)- On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem
- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
- Implication and analysis in classical Frege structures
- Compactness in constructive analysis revisited
- On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
- A type-free system extending (ZFC)
- Constructing best approximations on a Jordan curve
- Computability structure of the Sobolev spaces and its applications
- On the computability of fractal dimensions and Hausdorff measure
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
- Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
- Limiting semantics of numerical programs
- A constructive theory of point-set nearness.
- Wittgenstein and finitism
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- A Banach-Mazur computable but not Markov computable function on the computable real numbers
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
- Apartness spaces as a framework for constructive topology
- Formal spaces and their effective presentations
- An abstract data type for real numbers
- Computable irrational numbers with representations of surprising complexity
- On the computability of binary social choice rules in an infinite society and the halting problem
- Computational complexity of solving polynomial differential equations over unbounded domains
- Demuth's path to randomness
- Church's thesis without tears
- Some Research Problems about Algebraic Differential Equations
- Recursivity in Quantum Mechanics
- Computability and Noncomputability in Classical Analysis
- European Summer Meeting of the Association for Symbolic Logic
- Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
- On the complexity of computable real sequences
- Derivatives of Computable Functions
- Sequential, pointwise, and uniform continuity: A constructive note
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- Constructivity, Computability and Computers in Economic Theory: Some Cautionary Notes
- European Summer Meeting of the Association for Symbolic Logic
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- Complexity of blowup problems (extended abstract)
- Notes on computable analysis
- On local non‐compactness in recursive mathematics
- Specker sequences revisited
- The prime number theorem is PRA-provable
- Separating notions in effective topology
- How much partiality is needed for a theory of computability?
- COMPUTABLY COMPACT METRIC SPACES
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Reflections on function spaces
- Computably and punctually universal spaces
- Computability in linear algebra
- Differential equations in constructive analysis and in the recursive realizability topos
- Fixed point theory in weak second-order arithmetic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910522)