scientific article; zbMATH DE number 1460545
From MaRDI portal
Publication:4485693
zbMATH Open0956.68056MaRDI QIDQ4485693FDOQ4485693
Authors: Klaus Weihrauch 
Publication date: 18 June 2000
Title of this publication is not available (Why is that?)
Recommendations
computable analysiscomputabilityTuring machinestype-2 theory of effectivitycomputable metric spacesnaming systems
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable (26A15) Complexity of computation (including implicit computational complexity) (03D15) Constructive and recursive analysis (03F60) Constructive real analysis (26E40)
Cited In (only showing first 100 items - show all)
- 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
- On envelopes and backward approximations
- Effective compactness and orbits of points under the isometry group
- Metric spaces are universal for bi-interpretation with metric structures
- Liouville numbers and the computational complexity of changing bases
- On the complexity of conversion between classic real number representations
- Some notes on spaces of ideals and computable topology
- Betwixt Turing and Kleene
- Prediction of Recursive Real-Valued Functions from Finite Examples
- Completion of choice
- Parametrised second-order complexity theory with applications to the study of interval computation
- Proof mining in \(L_{1}\)-approximation
- Characterizing polynomial time complexity of stream programs using interpretations
- A game-semantic model of computation
- Effective wadge hierarchy in computable quasi-Polish spaces
- Outline of partial computability in computable topology
- Towards computable analysis on the generalised real line
- Computability of topological pressure for shifts of finite type with applications in statistical physics
- Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
- Computability of topological pressure on compact shift spaces beyond finite type*
- Computability at zero temperature
- On the Kolmogorov complexity of continuous real functions
- USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- On images of partial computable functions over computable Polish spaces
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints
- Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
- A note on computable distinguishing colorings
- On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem
- On the Computable Theory of Bounded Analytic Functions
- Computing the exact number of periodic orbits for planar flows
- On the computability of rotation sets and their entropies
- Many-one reductions and the category of multivalued functions
- Computability of products of chainable continua
- Precomplete numberings
- Computability of pseudo-cubes
- Computable subcontinua of semicomputable chainable Hausdorff continua
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
- A comparison of concepts from computable analysis and effective descriptive set theory
- Chainable and circularly chainable semicomputable sets in computable topological spaces
- Weihrauch and constructive reducibility between existence statements
- Computability of Differential Equations
- Three topological reducibilities for discontinuous functions
- A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
- Highness properties close to PA completeness
- The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints
- THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER
- Computing the exponent of a Lebesgue space
- Moduli of regularity and rates of convergence for Fejér monotone sequences
- Towards a descriptive theory of cb0-spaces
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Characterization of Kurtz randomness by a differentiation theorem
- On the computability of the set of automorphisms of the unit square
- A continuous characterization of PSPACE using polynomial ordinary differential equations
- Computability and Analysis, a Historical Approach
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Discreteness is undecidable
- Constructive hybrid games
- Irrational-based computability of functions
- Polynomial time over the reals with parsimony
- Non-collapse of the effective wadge hierarchy
- On the difference hierarchy in countably based \(T_{0}\)-spaces
- The Brouwer Fixed Point Theorem Revisited
- Abstract State Machines with Exact Real Arithmetic
- The computable kernel of abstract state machines
- On the Lattices of Effectively Open Sets
- Complexity of operators on compact sets
- Title not available (Why is that?)
- Programming Experimental Procedures for Newtonian Kinematic Machines
- Online computations of differentiable functions
- A Survey on Analog Models of Computation
- Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society
- The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience)
- On the computational content of the Lawson topology
- The basic feasible functionals in computable analysis
- Seven Kinds of Computable and Constructive Infelicities in Economics
- Jordan curves with polynomial inverse moduli of continuity
- Game characterizations and lower cones in the Weihrauch degrees
- On Turing degrees of points in computable topology
- On the complexity of computing the logarithm and square root functions on a complex domain
- A computable version of Banach's inverse mapping theorem
- Computations via Newtonian and relativistic kinematic systems
- Computing Schrödinger propagators on type-2 Turing machines
- Proceedings of the 6th workshop on computability and complexity in analysis (CCA 2004), Lutherstadt Wittenberg, Germany, August 16--20, 2004
- A topological view on algebraic computation models
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
- Alan Turing and the foundations of computable analysis
- Hierarchies of function classes defined by the first-value operator
- A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
- PAC learning, VC dimension, and the arithmetic hierarchy
- Effective subsets under homeomorphisms of \(\mathbb{R}^n\)
- Computing the uncomputable; or, the discrete charm of second-order simulacra
- The influence of domain interpretations on computational models
- What is a universal computing machine?
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
- THE DISCONTINUITY PROBLEM
- The P\(\neq\) NP conjecture in the context of real and complex analysis
- Language equations
- Problems, solutions, and completions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485693)
