Computable functionals
From MaRDI portal
Publication:3226752
DOI10.4064/FM-42-1-168-202zbMATH Open0066.26001OpenAlexW4239497877MaRDI QIDQ3226752FDOQ3226752
Authors: Andrzej Grzegorczyk
Publication date: 1955
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213369
Cited In (72)
- How incomputable is the separable Hahn-Banach theorem?
- Effectivity on continuous functions in topological spaces
- Feferman on computability
- COMPUTABLY COMPACT METRIC SPACES
- Models of computation for partial functions on the reals
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Theses for computation and recursion on concrete and abstract structures
- Computable Geometric Complex Analysis and Complex Dynamics
- On computable metrization
- Dimensions of Points in Self-similar Fractals
- A Galois connection between Turing jumps and limits
- Multi-resolution cellular automata for real computation
- Dimension spectra of random subfractals of self-similar fractals
- On the continued fraction representation of computable real numbers
- Parametrised second-order complexity theory with applications to the study of interval computation
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- Intersection points of planar curves can be computed
- On the time complexity of partial real functions
- Computability on the probability measures on the Borel sets of the unit interval
- A refined model of computation for continuous problems
- Complexity of blowup problems (extended abstract)
- Curves that must be retraced
- Analytical properties of resource-bounded real functionals
- Real Number Calculations and Theorem Proving
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Relatively recursive reals and real functions
- Computable Banach spaces via domain theory
- A characterization of computable analysis on unbounded domains using differential equations
- Physical computability theses
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
- A survey of recursive analysis and Moore's notion of real computation
- Index sets in computable analysis
- The elementary computable functions over the real numbers: applying two new techniques
- From axiomatics to intrinsic characterization: some open problems in computable analysis
- The wave equation with computable initial data such that its unique solution is not computable
- Computability structure of the Sobolev spaces and its applications
- Markov's constructive analysis; a participant's view
- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
- An analog characterization of the Grzegorczyk hierarchy
- Computable preference and utility
- Recursive characterization of computable real-valued functions and relations
- A topological view on algebraic computation models
- Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- The solution operator of the Korteweg-de Vries equation is computable
- A comparison of identification criteria for inductive inference of recursive real-valued functions
- Toward a clarity of the extreme value theorem
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
- Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
- Computability and analysis, a historical approach
- Three topological reducibilities for discontinuous functions
- Computing the uncomputable; or, the discrete charm of second-order simulacra
- Computability versus exact computability of martingales
- Non-computable Julia sets
- Effectiveness in RPL, with applications to continuous logic
- Efficient exact computation of iterated maps
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Concrete models of computation for topological algebras
- Computation by `While' programs on topological partial algebras
- A domain-theoretic approach to computability on the real line
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
- Title not available (Why is that?)
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- Computational unsolvability of domains of attraction of nonlinear systems
- Noncomputability in models of physical phenomena
- Computability and Noncomputability in Classical Analysis
- Notes on computable analysis
- Effectively closed sets and graphs of computable real functions.
- Three concepts of decidability for general subsets of uncountable spaces
- An effective Riemann Mapping Theorem
- The methods of approximation and lifting in real computation
This page was built for publication: Computable functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3226752)