scientific article

Publication date: 17 September 1992

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

recursive analysis computable operators computable Banach space computable \(C^ 1\) function

Constructive and recursive analysis (03F60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to functional analysis (46-02) Applications of computability and recursion theory (03D80) Constructive functional analysis (46S30)

Related Items (only showing first 100 items - show all)

Smooth finitely computable functions are affine, or why quantum systems cause waves ⋮ A semilattice of degrees of computable metrics ⋮ New degree spectra of Polish spaces ⋮ Computing with polynomial ordinary differential equations ⋮ Comparing representations for function spaces in computable analysis ⋮ Recursive characterization of computable real-valued functions and relations ⋮ Infinite-dimensional features of matrices and pseudospectra ⋮ A sequentially computable function that is not effectively continuous at any point ⋮ 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 ⋮ Effective continuities on effective topological spaces ⋮ Computing Schrödinger propagators on type-2 Turing machines ⋮ Computation with perturbed dynamical systems ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Computability of analog networks ⋮ On the complexity of computing the logarithm and square root functions on a complex domain ⋮ Quantum systems with diagonal singularity: Their logic and intrinsic irreversibility ⋮ Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine ⋮ A topological view on algebraic computation models ⋮ On the functions generated by the general purpose analog computer ⋮ Limiting semantics of numerical programs ⋮ Dimension spectra of random subfractals of self-similar fractals ⋮ What is the axiomatic method? ⋮ Quantization causes waves: smooth finitely computable functions are affine ⋮ Random elements in effective topological spaces with measure. ⋮ An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable ⋮ A blend of methods of recursion theory and topology. ⋮ Computational complexity of iterated maps on the interval ⋮ On an ad hoc computability structure in a Hilbert space ⋮ Constructive and computable Hahn-Banach theorems for the (second) fundamental theorem of welfare economics ⋮ Recursive quasi-metric spaces. ⋮ Computability on subsets of metric spaces. ⋮ Unique existence, approximate solutions, and countable choice. ⋮ Computability of entropy and information in classical Hamiltonian systems ⋮ Borel complexity and computability of the Hahn-Banach theorem ⋮ Undecidability and incompleteness in classical mechanics ⋮ Characterizations of semicomputable sets of real numbers ⋮ On computability of the Galerkin procedure ⋮ Domain representability of metric spaces ⋮ Are unbounded linear operators computable on the average for Gaussian measures? ⋮ Computable neighbourhoods of points in semicomputable manifolds ⋮ Pure mathematics and physical reality (continuity and computability) ⋮ Notes on computable analysis ⋮ Effective versions of local connectivity properties ⋮ Computing conformal maps of finitely connected domains onto canonical slit domains ⋮ Computability in linear algebra ⋮ On the asymptotic behavior of odd operators ⋮ Curves that must be retraced ⋮ The computational complexity of distance functions of two-dimensional domains ⋮ The world's shortest correct exact real arithmetic program? ⋮ The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited ⋮ A characterization of computable analysis on unbounded domains using differential equations ⋮ Co-c.e. sets with disconnected complements ⋮ Jordan curves with polynomial inverse moduli of continuity ⋮ General relativistic hypercomputing and foundation of mathematics ⋮ The metamathematics of ergodic theory ⋮ A computable version of Banach's inverse mapping theorem ⋮ Classification of computably approximable real numbers ⋮ Constructive chaos by cellular automata and possible sources of an arrow of time ⋮ Computable invariance ⋮ Computable de Finetti measures ⋮ Feasible real random access machines ⋮ Computing fundamental domains for Fuchsian groups ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ Computational bounds on polynomial differential equations ⋮ Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮ Grzegorczyk's hierarchy of computable analysis ⋮ Computability on continuous, lower semi-continuous and upper semi-continuous real functions ⋮ Simple equations on real intervals ⋮ Computable Banach spaces via domain theory ⋮ On approximate and algebraic computability over the real numbers ⋮ An effective Riemann Mapping Theorem ⋮ Markov's constructive analysis; a participant's view ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis ⋮ Online computations of differentiable functions ⋮ Computation by `While' programs on topological partial algebras ⋮ Effectiveness of the global modulus of continuity on metric spaces ⋮ Effective properties of sets and functions in metric spaces with computability structure ⋮ Calculating the spectral factorization and outer functions by sampling-based approximations -- fundamental limitations ⋮ On the computability of fractal dimensions and Hausdorff measure ⋮ Approximation methods in inductive inference ⋮ 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 ⋮ Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval ⋮ Quantified constraints under perturbation ⋮ A constructive algorithm for finding the exact roots of polynomials with computable real coefficients. ⋮ 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. ⋮ Effective simultaneous approximability of reals. ⋮ On the computability of Walsh functions. ⋮ Real number computation through Gray code embedding. ⋮ Interpolation functor and computability. ⋮ The closure properties on real numbers under limits and computable operators. ⋮ Extended admissibility. ⋮ Presentations of computably enumerable reals. ⋮ Links between physics and set theory. ⋮ Stability versus speed in a computable algebraic model

This page was built for publication: