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
- On the Lattices of Effectively Open 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
- Complexity of Operators on Compact Sets
- Problems, solutions, and completions
- Constructing locally connected non-computable Julia sets
- Random elements in effective topological spaces with measure.
- 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
- Computing the Topological Entropy of Shifts
- On Computable Compact Operators on Banach Spaces
- Revising Type-2 Computation and Degrees of Discontinuity
- CGMurphi: automatic synthesis of numerical controllers for nonlinear hybrid systems
- Dimension spectra of random subfractals of self-similar fractals
- A stream calculus of bottomed sequences for real number computation
- Computability of countable subshifts in one dimension
- Separating notions in effective topology
- Assume–guarantee verification of nonlinear hybrid systems with <scp>Ariadne</scp>
- Fixed point theorems on partial randomness
- Closed choice and a uniform low basis theorem
- Effectivizing Lusin’s Theorem
- The fan theorem and unique existence of maxima
- Notions of Probabilistic Computability on Represented Spaces
- Abstract geometrical computation. III: Black holes for classical and analog computing
- Weakly computable real numbers
- Independent subbases and non-redundant codings of separable metrizable spaces
- Characterizing time computational complexity classes with polynomial differential equations
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
- Reducibilities relating to Schnorr randomness
- On the asymptotic behavior of odd operators
- Coinduction for exact real number computation
- Borel complexity and computability of the Hahn-Banach theorem
- Computational bounds on polynomial differential equations
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Recent progress in exact geometric computation
- Continuity and computability of reachable sets
- Title not available (Why is that?)
- Probability, statistics and computation in dynamical systems
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Computability and Representations of the Zero Set
- Computable Carathéodory theory
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Computability on subsets of metric spaces.
- Pre-apartness structures on spaces of functions
- Some computational aspects of metric fixed-point theory
- Real number computation through Gray code embedding.
- Topological properties of real number representations.
- Abstract geometrical computation. V: Embedding computable analysis
- An optical model of computation
- Fine hierarchies and m-reducibilities in theoretical computer science
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Optimization problems with fixed volume constraints and stability results related to rearrangement classes
- Computing with polynomial ordinary differential equations
- Some remarks on real numbers induced by first-order spectra
- Metric spaces in synthetic topology
- A tutorial on computable analysis
- Complexity issues for preorders on finite labeled forests
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)
