scientific article

From MaRDI portal
Revision as of 20:50, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3910522

zbMath0461.03015MaRDI QIDQ3910522

Oliver Aberth

Publication date: 1980


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (51)

Computational complexity of solving polynomial differential equations over unbounded domainsWhich set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?European Summer Meeting of the Association for Symbolic LogicImplication and analysis in classical Frege structuresRecursivity in Quantum MechanicsCompactness in constructive analysis revisitedOn the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysisFormal spaces and their effective presentationsA type-free system extending (ZFC)Sequential, pointwise, and uniform continuity: A constructive noteLimiting semantics of numerical programsOn the complexity of computable real sequencesSeparating notions in effective topologyHow much partiality is needed for a theory of computability?Computability and Noncomputability in Classical AnalysisCOMPUTABLY COMPACT METRIC SPACESUnrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computingAn abstract data type for real numbersComputable irrational numbers with representations of surprising complexityFixed point theory in weak second-order arithmeticReflections on function spacesA constructive theory of point-set nearness.Specker sequences revisitedComputable and Continuous Partial Homomorphisms on Metric Partial AlgebrasNotes on computable analysisRecursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive AnalysisOn the computability of binary social choice rules in an infinite society and the halting problemEffective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys ApproachComplexity of Blowup ProblemsConstructivity, Computability and Computers in Economic Theory: Some Cautionary NotesA Banach-Mazur computable but not Markov computable function on the computable real numbersComputability in linear algebraThe prime number theorem is PRA-provableChurch's thesis without tearsDEMUTH’S PATH TO RANDOMNESSConstructing best approximations on a Jordan curveOn the computability of quasi-transitive binary social choice rules in an infinite society and the halting problemThe eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is notOn local non‐compactness in recursive mathematicsDerivatives of Computable FunctionsComputability structure of the Sobolev spaces and its applicationsOn the computability of fractal dimensions and Hausdorff measurePoint-free topological spaces, functions and recursive points; filter foundation for recursive analysis. IWittgenstein and finitismRecursive and nonextendible functions over the reals; filter foundation for recursive analysis. IINoncomputability in analysis and physics: A complete determination of the class of noncomputable linear operatorsRational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact intervalDifferential equations in constructive analysis and in the recursive realizability toposEuropean Summer Meeting of the Association for Symbolic LogicApartness spaces as a framework for constructive topologySome Research Problems about Algebraic Differential Equations







This page was built for publication: