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)
- Constructive game logic
- Jordan Areas and Grids
- Algorithmic randomness and Fourier analysis
- Statistical properties of dynamical systems -- Simulation and abstract computation
- On the uniform computational content of Ramsey's theorem
- Investigations on the approximability and computability of the Hilbert transform with applications
- Computable elements and functions in effectively enumerable topological spaces
- Effectiveness for embedded spheres and balls
- Addendum to: ``The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- A Banach-Mazur computable but not Markov computable function on the computable real numbers
- Complexity of blowup problems (extended abstract)
- Curves that must be retraced
- Computability and computational complexity of the evolution of nonlinear dynamical systems
- Analytical properties of resource-bounded real functionals
- The computational complexity of distance functions of two-dimensional domains
- Is the Mandelbrot set computable?
- Computability of analog networks
- \(K\)-triviality in computable metric spaces
- Relative computability and uniform continuity of relations
- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
- On uniform relationships between combinatorial problems
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- The derivational complexity of string rewriting systems
- Demuth's path to randomness
- Towards computability of elliptic boundary value problems in variational formulation
- Experimental computation of real numbers by Newtonian machines
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
- Computational complexity of iterated maps on the interval
- Computability and the Implicit Function Theorem
- Effective genericity and differentiability
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
- On the computing power of fuzzy Turing machines
- Computing fundamental domains for Fuchsian groups
- Computable Measure Theory and Algorithmic Randomness
- Title not available (Why is that?)
- Towards computability over effectively enumerable topological spaces
- On computability of the Galerkin procedure
- Characterizations of semicomputable sets of real numbers
- Non-computable Julia sets
- Beta-shifts, their languages, and computability
- Effectiveness in RPL, with applications to continuous logic
- Computability of finite-dimensional linear subspaces and best approximation
- Recursive analysis of singular ordinary differential equations
- Efficient exact computation of iterated maps
- The power of backtracking and the confinement of length
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- A Wadge hierarchy for second countable spaces
- Computability in planar dynamical systems
- Computability and dynamical systems
- Maximal computability structures
- Wadge hardness in Scott spaces and its effectivization
- Wadge-like reducibilities on arbitrary quasi-Polish spaces
- Points on Computable Curves of Computable Lengths
- A differential operator and weak topology for Lipschitz maps
- Representation theorems for analytic machines and computability of analytic functions
- Denotational semantics of hybrid automata
- Fractal dimension versus process complexity
- Computability of Brolin-Lyubich measure
- Computability of entropy and information in classical Hamiltonian systems
- Dense computability structures
- Measures and their random reals
- Computability, noncomputability, and hyperbolic systems
- Towards a descriptive set theory for domain-like structures
- On TAE machines and their computational power
- Computable neighbourhoods of points in semicomputable manifolds
- Extended admissibility.
- Embedding infinitely parallel computation in Newtonian kinematics
- The many forms of hypercomputation
- On computational complexity of Siegel Julia sets
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- Degrees of unsolvability of continuous functions
- Computational unsolvability of domains of attraction of nonlinear systems
- Primitive recursiveness of real numbers under different representations
- Exact real arithmetic using centred intervals and bounded error terms
- Towards the Effective Descriptive Set Theory
- Notes on computable analysis
- Computability of analytic functions with analytic machines
- Computable scalar fields: A basis for PDE software
- Real computations with fake numbers
- Recursive quasi-metric spaces.
- Uniform procedures in uncountable structures
- The Wadge order on the Scott domain is not a well-quasi-order
- 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
- Towards a descriptive theory of cb\(_{0}\)-spaces
- A game-semantic model of computation
- Effective wadge hierarchy in computable quasi-Polish spaces
- Outline of partial computability in computable topology
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)
