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
- 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
- A semilattice of degrees of computable metrics
- New degree spectra of Polish spaces
- Computability of measurable sets via effective metrics
- Sheaf toposes for realizability
- In Praise of Numerical Computation
- Computability on random events and variables in a computable probability space
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Primitive recursive ordered fields and some applications
- Computability of measurable sets via effective topologies
- A constructive theory of point-set nearness.
- On the hierarchy and extension of monotonically computable real numbers.
- Representing probability measures using probabilistic processes
- Randomness for non-computable measures
- A computable approach to measure and integration theory
- Intersection points of planar curves can be computed
- Characterizing Computable Analysis with Differential Equations
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- A certified, corecursive implementation of exact real numbers
- Towards using exact real arithmetic for initial value problems
- Can we compute the similarity between surfaces?
- Reducibility of computable metrics on the real line
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
- Computability of Polish spaces up to homeomorphism
- Game characterizations and lower cones in the Weihrauch degrees
- Computable metrics above the standard real metric
- Quantified constraints under perturbation
- Computable topological groups and Pontryagin duality
- Computable analysis and classification problems
- Degrees of non-computability of homeomorphism types of Polish spaces
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Average-case polynomial-time computability of Hamiltonian dynamics
- Effectively open real functions
- The metamathematics of ergodic theory
- A characterization of computable analysis on unbounded domains using differential equations
- Co-c.e. sets with disconnected complements
- On degree spectra of topological spaces
- Classification of computably approximable real numbers
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Technical report: computation on the extended complex plane and conformal mapping of multiply-connected domains
- The elementary computable functions over the real numbers: applying two new techniques
- A variational principle in the parametric geometry of numbers, with applications to metric Diophantine approximation
- An analog characterization of the Grzegorczyk hierarchy
- Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computable structures and operations on the space of continuous functions
- A computable version of the Daniell-Stone theorem on integration and linear functionals
- Randomness and the ergodic decomposition
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)
