scientific article

Publication date: 1980

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

numerical computation programs non-existence of decision procedures

Constructive and recursive analysis (03F60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to real functions (26-01) Software, source code, etc. for problems pertaining to real functions (26-04) Software, source code, etc. for problems pertaining to functions of a complex variable (30-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to functions of a complex variable (30-01)

Related Items

Computational complexity of solving polynomial differential equations over unbounded domains, Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?, European Summer Meeting of the Association for Symbolic Logic, Implication and analysis in classical Frege structures, Recursivity in Quantum Mechanics, Compactness in constructive analysis revisited, On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis, Formal spaces and their effective presentations, A type-free system extending (ZFC), Sequential, pointwise, and uniform continuity: A constructive note, Limiting semantics of numerical programs, On the complexity of computable real sequences, Separating notions in effective topology, How much partiality is needed for a theory of computability?, Computability and Noncomputability in Classical Analysis, COMPUTABLY COMPACT METRIC SPACES, Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing, An abstract data type for real numbers, Computable irrational numbers with representations of surprising complexity, Fixed point theory in weak second-order arithmetic, Reflections on function spaces, A constructive theory of point-set nearness., Specker sequences revisited, Computable and Continuous Partial Homomorphisms on Metric Partial Algebras, Notes on computable analysis, Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis, On the computability of binary social choice rules in an infinite society and the halting problem, Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach, Complexity of Blowup Problems, Constructivity, Computability and Computers in Economic Theory: Some Cautionary Notes, A Banach-Mazur computable but not Markov computable function on the computable real numbers, Computability in linear algebra, The prime number theorem is PRA-provable, Church's thesis without tears, DEMUTH’S PATH TO RANDOMNESS, Constructing best approximations on a Jordan curve, On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem, The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, On local non‐compactness in recursive mathematics, Derivatives of Computable Functions, 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, Wittgenstein and finitism, Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II, Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators, Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval, Differential equations in constructive analysis and in the recursive realizability topos, European Summer Meeting of the Association for Symbolic Logic, Apartness spaces as a framework for constructive topology, Some Research Problems about Algebraic Differential Equations