Computable functionals
From MaRDI portal
Publication:3226752
DOI10.4064/fm-42-1-168-202zbMath0066.26001OpenAlexW4239497877MaRDI QIDQ3226752
Publication date: 1955
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213369
Related Items (72)
An analog characterization of the Grzegorczyk hierarchy ⋮ Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ Three topological reducibilities for discontinuous functions ⋮ Computability versus exact computability of martingales ⋮ On the continued fraction representation of computable real numbers ⋮ Recursive characterization of computable real-valued functions and relations ⋮ Computability and Analysis, a Historical Approach ⋮ Intersection points of planar curves can be computed ⋮ Computational unsolvability of domains of attraction of nonlinear systems ⋮ Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma ⋮ 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 ⋮ Dimension spectra of random subfractals of self-similar fractals ⋮ Computability and Noncomputability in Classical Analysis ⋮ Dimensions of Points in Self-similar Fractals ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ The wave equation with computable initial data such that its unique solution is not computable ⋮ Effectiveness in RPL, with applications to continuous logic ⋮ Physical Computability Theses ⋮ Computable preference and utility ⋮ Noncomputability in models of physical phenomena ⋮ The elementary computable functions over the real numbers: applying two new techniques ⋮ Real Number Calculations and Theorem Proving ⋮ On the time complexity of partial real functions ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Notes on computable analysis ⋮ Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis ⋮ The Solution Operator of the Korteweg-de Vries Equation is Computable ⋮ How Incomputable is the Separable Hahn-Banach Theorem? ⋮ Complexity of Blowup Problems ⋮ Effectivity on Continuous Functions in Topological Spaces ⋮ Toward a clarity of the extreme value theorem ⋮ On Computable Metrization ⋮ The Methods of Approximation and Lifting in Real Computation ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ Models of computation for partial functions on the reals ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ Curves that must be retraced ⋮ Efficient exact computation of iterated maps ⋮ A characterization of computable analysis on unbounded domains using differential equations ⋮ A comparison of identification criteria for inductive inference of recursive real-valued functions ⋮ Analytical properties of resource-bounded real functionals ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Unnamed Item ⋮ Feferman on Computability ⋮ Computability, noncomputability and undecidability of maximal intervals of IVPs ⋮ Non-computable Julia sets ⋮ A refined model of computation for continuous problems ⋮ Multi-Resolution Cellular Automata for Real Computation ⋮ Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System ⋮ A domain-theoretic approach to computability on the real line ⋮ Relatively recursive reals and real functions ⋮ The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not ⋮ Computing the uncomputable; or, the discrete charm of second-order simulacra ⋮ Computability on subsets of Euclidean space. I: Closed and compact subsets ⋮ Index sets in computable analysis ⋮ Computable Banach spaces via domain theory ⋮ An effective Riemann Mapping Theorem ⋮ Markov's constructive analysis; a participant's view ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis ⋮ Concrete models of computation for topological algebras ⋮ Computation by `While' programs on topological partial algebras ⋮ Computability on the probability measures on the Borel sets of the unit interval ⋮ Computability structure of the Sobolev spaces and its applications ⋮ Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I ⋮ Unnamed Item ⋮ Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators ⋮ Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions ⋮ Computable Geometric Complex Analysis and Complex Dynamics ⋮ Effectively closed sets and graphs of computable real functions. ⋮ Three concepts of decidability for general subsets of uncountable spaces
This page was built for publication: Computable functionals
