Computable invariance
From MaRDI portal
Publication:1274805
DOI10.1016/S0304-3975(98)00095-4zbMath0915.68047OpenAlexW2912268883MaRDI 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
On the uniform computational content of the Baire category theorem ⋮ Comparing representations for function spaces in computable analysis ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ On the uniform computational content of computability theory ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Computability on subsets of metric spaces. ⋮ Unnamed Item ⋮ Are unbounded linear operators computable on the average for Gaussian measures? ⋮ On the algebraic structure of Weihrauch degrees ⋮ Computability of Solutions of Operator Equations ⋮ Unnamed Item ⋮ Weihrauch degrees, omniscience principles and weak computability ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computability on subsets of Euclidean space. I: Closed and compact subsets ⋮ Probabilistic computability and choice ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency
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
This page was built for publication: Computable invariance
