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)
- Uniformly Computable Aspects of Inner Functions
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
- Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines
- The Solution Operator of the Korteweg-de Vries Equation is Computable
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- Hypergeometric Functions in Exact Geometric Computation
- Title not available (Why is that?)
- Computability of the Radon-Nikodym Derivative
- \(\Sigma\)-definability in hereditarily finite superstructures and computable analysis
- On higher effective descriptive set theory
- Pointwise complexity of the derivative of a computable function
- Algorithmic identification of probabilities is hard
- Algorithmic randomness over general spaces
- Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$
- The closure properties on real numbers under limits and computable operators.
- Berechenbare Reelle Funktionenfolgen
- On the uniform computational content of the Baire category theorem
- Comparing representations for function spaces in computable analysis
- Hierarchies of total functionals over the reals
- A survey of recursive analysis and Moore's notion of real computation
- Bounded Turing reductions and data processing inequalities for sequences
- Generated quasi-metric hyper and function spaces.
- The Vitali Covering Theorem in the Weihrauch Lattice
- Generalizing Computability Theory to Abstract Algebras
- Universality, optimality, and randomness deficiency
- On the Relationship between Filter Spaces and Weak Limit Spaces
- Weak colored local rules for planar tilings
- On computability and disintegration
- Probabilistic computability and choice
- On approximations for functions in the space of uniformly convergent Fourier series
- Real number computation with committed choice logic programming languages
- Non computable Mandelbrot-like sets for a one-parameter complex family
- Uniqueness, continuity and the existence of implicit functions in constructive analysis
- Effective Hausdorff dimension in general metric spaces
- Computing geometric Lorenz attractors with arbitrary precision
- Mutual dimension
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
- The Hausdorff and dynamical dimensions of self-affine sponges: a dimension gap result
- On the computability of a construction of Brownian motion
- Weihrauch Complexity in Computable Analysis
- Representations of Complete Uniform Spaces via Uniform Domains
- Title not available (Why is that?)
- Kolmogorov complexity and the geometry of Brownian motion
- Connected choice and the Brouwer fixed point theorem
- On the information carried by programs about the objects they compute
- On the uniform computational content of computability theory
- Computable topological abelian groups
- Semicomputable manifolds in computable topological spaces
- Title not available (Why is that?)
- The Kripke schema in metric topology
- Point Degree Spectra of Represented Spaces
- On the algebraic structure of Weihrauch degrees
- On constructive number fields and computability of solutions of PDEs
- Warsaw discs and semicomputability
- Dimension spectra of lines1
- 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?)
- 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
- 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.
- Alan Turing and the Foundations of Computable Analysis
- 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
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)
