Computable functionals - MaRDI portal

Cited in

(72)

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

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)