scientific article
From MaRDI portal
Publication:4002474
zbMath0791.03019MaRDI QIDQ4002474
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rootsordinary differential equationsmeasureintegrationdifferentiationoptimization problemcomplexity theoryinverse functionsmaximizationapproximation by polynomialscomputable real numberscomputational complexity of real functionscomputability in analysis
Constructive and recursive analysis (03F60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Constructive real analysis (26E40)
Related Items
Computational complexity of solving polynomial differential equations over unbounded domains, An analog characterization of the Grzegorczyk hierarchy, Computability of measurable sets via effective topologies, The Hausdorff-Ershov hierarchy in Euclidean spaces, Proof mining in \(L_{1}\)-approximation, Representation and poly-time approximation for pressure of \(\mathbb Z^2\) lattice models in the non-uniqueness region, Exact real computation of solution operators for linear analytic systems of partial differential equations, Computability versus exact computability of martingales, Some remarks on real numbers induced by first-order spectra, Comparing representations for function spaces in computable analysis, Recursive characterization of computable real-valued functions and relations, On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain, Effectively open real functions, Towards computability of elliptic boundary value problems in variational formulation, The basic feasible functionals in computable analysis, Computing Schrödinger propagators on type-2 Turing machines, Computation with perturbed dynamical systems, On the complexity of computing the logarithm and square root functions on a complex domain, Word problems in Elliott monoids, Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma, A topological view on algebraic computation models, On parallel complexity of analytic functions, On the functions generated by the general purpose analog computer, On the weak computability of a four dimensional orthogonal packing and time scheduling problem, Dimension spectra of random subfractals of self-similar fractals, Random elements in effective topological spaces with measure., Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra, Effectiveness in RPL, with applications to continuous logic, Recursive analysis of singular ordinary differential equations, A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs, Computational complexity of iterated maps on the interval, Reinforcement learning for a class of continuous-time input constrained optimal control problems, Computability on subsets of metric spaces., Continuous-time computation with restricted integration capabilities, Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy, Strong NP-completeness of a matrix similarity problem, A polynomial-time computable curve whose interior has a nonrecursive measure, Are unbounded linear operators computable on the average for Gaussian measures?, Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation, Computability on random events and variables in a computable probability space, Representation theorems for analytic machines and computability of analytic functions, Approximating the hard square entropy constant with probabilistic methods, A computational proof of complexity of some restricted counting problems, On the computational complexity of integral equations, Abstract geometrical computation. V: Embedding computable analysis, Computability in planar dynamical systems, A survey of recursive analysis and Moore's notion of real computation, A Banach-Mazur computable but not Markov computable function on the computable real numbers, Computability in linear algebra, Curves that must be retraced, A characterization of the entropies of multidimensional shifts of finite type, The computational complexity of distance functions of two-dimensional domains, The constructive reals as a Java library, A characterization of computable analysis on unbounded domains using differential equations, Jordan curves with polynomial inverse moduli of continuity, Two algorithms in search of a type-system, A computable version of Banach's inverse mapping theorem, Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families, Coinduction for exact real number computation, Classification of computably approximable real numbers, A refined model of computation for continuous problems, A computable approach to measure and integration theory, \(\delta\)-uniform BSS machines, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], Computable invariance, Relatively recursive reals and real functions, Feasible real random access machines, What Monte Carlo models can do and cannot do efficiently?, Computing the uncomputable; or, the discrete charm of second-order simulacra, Computational bounds on polynomial differential equations, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Computability on continuous, lower semi-continuous and upper semi-continuous real functions, The Turing closure of an Archimedean field, Equality is a jump, Computability on subsets of Euclidean space. I: Closed and compact subsets, Index sets in computable analysis, On approximate and algebraic computability over the real numbers, An effective Riemann Mapping Theorem, Online computations of differentiable functions, Computation by `While' programs on topological partial algebras, Computability on the probability measures on the Borel sets of the unit interval, Effectiveness of the global modulus of continuity on metric spaces, Why does information-based complexity use the real number model?, Computability structure of the Sobolev spaces and its applications, Stochastic analog networks and computational complexity, On the computability of fractal dimensions and Hausdorff measure, Some aspects of studying an optimization or decision problem in different computational models, Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval, Integration in Real PCF, Real computations with fake numbers, Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions., Effectively closed sets and graphs of computable real functions., Effective metric spaces and representations of the reals., Real functions computable by finite automata using affine representations., The closure properties on real numbers under limits and computable operators., Extended admissibility., Presentations of computably enumerable reals., A dichotomy for real weighted Holant problems, Three concepts of decidability for general subsets of uncountable spaces, Stability versus speed in a computable algebraic model, Computable Riesz Representation for the Dual of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>C</mml:mi><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false"></mml:mo></mml:math>], The complexity of approximating the complex-valued Potts model, Quantitative analysis of a subgradient-type method for equilibrium problems, Fast online multiplication of real numbers, Polynomial differential equations compute all real computable functions on computable compact intervals, The topological strong spatial mixing property and new conditions for pressure approximation, Computability and Dynamical Systems, Points on Computable Curves of Computable Lengths, Computability and Analysis, a Historical Approach, Computability of probability measures and Martin-Löf randomness over metric spaces, New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory, Effective genericity and differentiability, Real-time computability of real numbers by chemical reaction networks, On the complexity of Anosov saddle transitions, The differential of probabilistic entailment, Computability of topological entropy: from general systems to transformations on Cantor sets and the interval, Unnamed Item, Computational intractability of attractors in the real quadratic family, On the computational complexity of the Dirichlet Problem for Poisson's Equation, Dimensions of Points in Self-similar Fractals, Computability on measurable functions, Hierarchies of function classes defined by the first-value operator, Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations, On the complexity of computing the Hausdorff distance, Remarks on the effective Jordan decomposition, Computable symbolic dynamics, Computable preference and utility, Coherence Spaces and Uniform Continuity, Who Asked Us? How the Theory of Computing Answers Questions about Analysis, Promise Problems on Probability Distributions, On the time complexity of partial real functions, Average-case polynomial-time computability of hamiltonian dynamics, Relating syntactic and semantic perturbations of hybrid automata, Computing Uniform Bounds, Trivial Reals, A Natural Weak Limit Space with Admissible Representation which is not a Limit Space, The Solution Operator of the Korteweg-de Vries Equation is Computable, Effectively Absolute Continuity and Effective Jordan Decomposability, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Generalised entropies and asymptotic complexities of languages, Characterizing Computable Analysis with Differential Equations, Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach, Lower Bounds on the Continuation of Holomorphic Functions, Complexity of Blowup Problems, Computing Solutions of Symmetric Hyperbolic Systems of PDE's, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mi mathvariant="script">E</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:math>-computability of e, π and Other Famous Constants, Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs, Effective Symbolic Dynamics, Complexity of Operators on Compact Sets, On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane, Notions of Probabilistic Computability on Represented Spaces, Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus, Computability of Analytic Functions with Analytic Machines, On the Complexity of the Pancake Problem, Primitive Recursiveness of Real Numbers under Different Representations, The Methods of Approximation and Lifting in Real Computation, Jordan Curves with Polynomial Inverse Moduli of Continuity, Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer, Computation of algebraic numbers and arithmetic operations over them with linear memory, Quasi-decidability of a fragment of the first-order theory of real numbers, Computability, noncomputability, and hyperbolic systems, How much can analog and hybrid systems be proved (super-)Turing, A computable version of the Daniell-Stone theorem on integration and linear functionals, Foundations of Exact Rounding, Analytical properties of resource-bounded real functionals, Parametrised second-order complexity theory with applications to the study of interval computation, On the complexity of fitted toral dynamics, On computably locally compact Hausdorff spaces, Prediction of Recursive Real-Valued Functions from Finite Examples, Polynomial time over the reals with parsimony, On subrecursive complexity of integration, Вычисление гипергеометрических рядов с квазилинейной временной и линейной eмкостной сложностью, Predictive Complexity for Games with Finite Outcome Spaces, Lp‐Computability, Computation of the optimal value function in time-dependent networks, Computability, noncomputability and undecidability of maximal intervals of IVPs, Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space, The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints, Multi-Resolution Cellular Automata for Real Computation, Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System, In Praise of Numerical Computation, Computability on the probability measures on the Borel sets of the unit interval, On the computability of the set of automorphisms of the unit square, Representations and evaluation strategies for feasibly approximable functions, Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision, The complexity of approximating the complex-valued Potts model, The complexity of partition functions, A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations, Computational complexity of classical solutions of partial differential equations, Characterizing polynomial time complexity of stream programs using interpretations, Liouville numbers and the computational complexity of changing bases, Quantitative coding and complexity theory of compact metric spaces, Computability of Real Numbers, Computability of Differential Equations, Computable Geometric Complex Analysis and Complex Dynamics, Computable Measure Theory and Algorithmic Randomness, Algorithmic Fractal Dimensions in Geometric Measure Theory, A Real Number Structure that is Effectively Categorical, Bit-complexity of solving systems of linear evolutionary partial differential equations, Computability of limit sets for two-dimensional flows, Computability Models: Algebraic, Topological and Geometric Algorithms, Computational unsolvability of domains of attraction of nonlinear systems, Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems, Computing the exact number of periodic orbits for planar flows, Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines, The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints, Separating notions in effective topology, On the main scientific achievements of Victor Selivanov, A domain-theoretic framework for robustness analysis of neural networks, A continuous characterization of PSPACE using polynomial ordinary differential equations, Complexity of optimizing over the integers, COMPUTABLY COMPACT METRIC SPACES, Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing, Unnamed Item, Quantitative continuity and Computable Analysis in Coq, Recursively enumerable reals and Chaitin \(\Omega\) numbers, On the hierarchies of Δ20-real numbers, A comparison of identification criteria for inductive inference of recursive real-valued functions, Non-computable Julia sets, Computable analysis with applications to dynamic systems, $LINSPACE$ конструктивный аналог функции $(1+x)^h$, Continuous and monotone machines, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item
