The following pages link to Computable functionals (Q3226752):
Displaying 50 items.
- Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
- Notes on computable analysis (Q519888) (← links)
- Curves that must be retraced (Q550254) (← links)
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
- Three concepts of decidability for general subsets of uncountable spaces (Q817852) (← links)
- Computability versus exact computability of martingales (Q834952) (← links)
- The elementary computable functions over the real numbers: applying two new techniques (Q926178) (← links)
- Computing the uncomputable; or, the discrete charm of second-order simulacra (Q1036071) (← links)
- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators (Q1054723) (← links)
- On the continued fraction representation of computable real numbers (Q1096627) (← links)
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664) (← links)
- The wave equation with computable initial data such that its unique solution is not computable (Q1154609) (← links)
- Noncomputability in models of physical phenomena (Q1168502) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- A domain-theoretic approach to computability on the real line (Q1274807) (← links)
- Relatively recursive reals and real functions (Q1274809) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Computable Banach spaces via domain theory (Q1292403) (← links)
- An effective Riemann Mapping Theorem (Q1292405) (← links)
- Markov's constructive analysis; a participant's view (Q1292407) (← links)
- From axiomatics to intrinsic characterization: some open problems in computable analysis (Q1292411) (← links)
- Concrete models of computation for topological algebras (Q1292413) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Computability on the probability measures on the Borel sets of the unit interval (Q1292415) (← links)
- Computability structure of the Sobolev spaces and its applications (Q1292420) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems (Q1764798) (← links)
- Efficient exact computation of iterated maps (Q1779563) (← links)
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not (Q1821332) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma (Q1919765) (← links)
- Computable preference and utility (Q1961959) (← links)
- On the time complexity of partial real functions (Q1977153) (← links)
- Toward a clarity of the extreme value theorem (Q2254563) (← links)
- Models of computation for partial functions on the reals (Q2258841) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Analytical properties of resource-bounded real functionals (Q2509953) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- Multi-Resolution Cellular Automata for Real Computation (Q3091455) (← links)
- Undecidability in <b>R</b><sup><i>n</i></sup>: Riddled Basins, the KAM Tori, and the Stability of the Solar System (Q3093489) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- Dimensions of Points in Self-similar Fractals (Q3511330) (← links)
- Real Number Calculations and Theorem Proving (Q3543660) (← links)
