scientific article; zbMATH DE number 5269070
From MaRDI portal
Publication:5384984
zbMath1145.03037MaRDI QIDQ5384984
Vasco Brattka, Weihrauch, Klaus, Peter H. Hertling
Publication date: 29 April 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80)
Related Items
Computational complexity of solving polynomial differential equations over unbounded domains ⋮ Characterizing time computational complexity classes with polynomial differential equations ⋮ New degree spectra of Polish spaces ⋮ Demuth’s Path to Randomness ⋮ Reducibilities relating to Schnorr randomness ⋮ Exact real computation of solution operators for linear analytic systems of partial differential equations ⋮ Computability and Analysis, a Historical Approach ⋮ Statistical properties of dynamical systems -- Simulation and abstract computation ⋮ The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable ⋮ Computability of topological entropy: from general systems to transformations on Cantor sets and the interval ⋮ Computability of topological pressure on compact shift spaces beyond finite type* ⋮ COMPUTABLE POLISH GROUP ACTIONS ⋮ Computing the exact number of periodic orbits for planar flows ⋮ Schnorr randomness for noncomputable measures ⋮ Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ A continuous characterization of PSPACE using polynomial ordinary differential equations ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ Computability on measurable functions ⋮ Characterization of Kurtz randomness by a differentiation theorem ⋮ An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable ⋮ On constructive number fields and computability of solutions of PDEs ⋮ Remarks on the effective Jordan decomposition ⋮ Coherence Spaces and Uniform Continuity ⋮ Computability at zero temperature ⋮ Relating syntactic and semantic perturbations of hybrid automata ⋮ Notes on computable analysis ⋮ On the Effective Existence of Schauder Bases ⋮ Quasi-decidability of a fragment of the first-order theory of real numbers ⋮ A Universal Ordinary Differential Equation ⋮ Computability, noncomputability, and hyperbolic systems ⋮ Analytical properties of resource-bounded real functionals ⋮ Computable topological groups and Pontryagin duality ⋮ Effectively closed subgroups of the infinite symmetric group ⋮ Computable structures and operations on the space of continuous functions ⋮ On the computability of rotation sets and their entropies ⋮ Computable analysis with applications to dynamic systems ⋮ The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ Computable de Finetti measures ⋮ $K$-triviality in computable metric spaces ⋮ Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision ⋮ Effective symbolic dynamics, random points, statistical behavior, complexity and entropy ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Irrational-based computability of functions ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computing geometric Lorenz attractors with arbitrary precision ⋮ Computable topological abelian groups ⋮ A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Computable analysis and classification problems ⋮ Degrees of non-computability of homeomorphism types of Polish spaces ⋮ Computability of Subsets of Metric Spaces ⋮ Admissibly Represented Spaces and Qcb-Spaces ⋮ Weihrauch Complexity in Computable Analysis ⋮ Schnorr triviality and its equivalent notions ⋮ Computability of limit sets for two-dimensional flows
This page was built for publication:
