scientific article
From MaRDI portal
Publication:3226754
zbMath0066.26101MaRDI QIDQ3226754
Publication date: 1955
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ Three topological reducibilities for discontinuous functions ⋮ Polynomial differential equations compute all real computable functions on computable compact intervals ⋮ Recursive characterization of computable real-valued functions and relations ⋮ Computation with perturbed dynamical systems ⋮ Computational unsolvability of domains of attraction of nonlinear systems ⋮ A topological view on algebraic computation models ⋮ Dimension spectra of random subfractals of self-similar fractals ⋮ Physical Computability Theses ⋮ Notes on computable analysis ⋮ Algorithmic randomness and Fourier analysis ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ Models of computation for partial functions on the reals ⋮ Computability, noncomputability, and hyperbolic systems ⋮ Analytical properties of resource-bounded real functionals ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Lp‐Computability ⋮ Feferman on Computability ⋮ Computability, noncomputability and undecidability of maximal intervals of IVPs ⋮ A domain-theoretic approach to computability on the real line ⋮ The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not ⋮ Index sets in computable analysis ⋮ Computable Banach spaces via domain theory ⋮ An effective Riemann Mapping Theorem ⋮ 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 structure of the Sobolev spaces and its applications ⋮ 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 Complex Analysis ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory ⋮ A Real Number Structure that is Effectively Categorical
This page was built for publication:
