Computable invariance
From MaRDI portal
Publication:1274805
DOI10.1016/S0304-3975(98)00095-4zbMath0915.68047MaRDI QIDQ1274805
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00095-4
Related Items
Unnamed Item, On the algebraic structure of Weihrauch degrees, Unnamed Item, Computability of Solutions of Operator Equations, Weihrauch Complexity in Computable Analysis, Connected choice and the Brouwer fixed point theorem, The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma, Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra, Are unbounded linear operators computable on the average for Gaussian measures?, Computability on subsets of Euclidean space. I: Closed and compact subsets, Computability on subsets of metric spaces., On the uniform computational content of the Baire category theorem, Comparing representations for function spaces in computable analysis, On the uniform computational content of computability theory, Probabilistic computability and choice, Universality, optimality, and randomness deficiency, Weihrauch degrees, omniscience principles and weak computability, Effective Choice and Boundedness Principles in Computable Analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time computable curve whose interior has a nonrecursive measure
- Compactness in constructive analysis revisited
- Representations of the real numbers and of the open subsets of the set of real numbers
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Recursive characterization of computable real-valued functions and relations
- Computability on computable metric spaces
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- On the definitions of computable real continuous functions
- Order-free Recursion on the Real Numbers
- Computational Complexity of Two-Dimensional Regions
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
