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)
- Abstract State Machines with Exact Real Arithmetic
- The computable kernel of abstract state machines
- Complexity of operators on compact sets
- 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
- Effectively open real functions
- Effective continuities on effective topological spaces
- The basic feasible functionals in computable analysis
- 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
- Constructing locally connected non-computable Julia sets
- On the lattices of effectively open sets
- Random elements in effective topological spaces with measure.
- Seven kinds of computable and constructive infelicities in economics
- Computability and the morphological complexity of some dynamics on continuous domains
- Computability of solutions of operator equations
- Topological Properties of Concept Spaces
- Intuitionistic fixed point logic
- Computability of graphs
- Effectively closed sets and graphs of computable real functions.
- Are unbounded linear operators computable on the average for Gaussian measures?
- The Church-Turing Thesis over Arbitrary Domains
- Quantitative coding and complexity theory of compact metric spaces
- A hypercomputational alien
- A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points
- On the complexity of computing the Hausdorff distance
- Computability of Real Numbers
- Computable analysis and Blaschke products
- 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
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)
