Computable Bases
Fuente:
arXiv
Saved in:
| Main Authors: | Brattka, Vasco, Rauzy, Emmanuel |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)
by: Brattka, Vasco, et al.
Published: (2025)
New definitions in the theory of Type 1 computable topological spaces
by: Rauzy, Emmanuel
Published: (2023)
by: Rauzy, Emmanuel
Published: (2023)
A generalization of Markov's approach to the continuity problem for Type 1 computable functions
by: Rauzy, Emmanuel
Published: (2023)
by: Rauzy, Emmanuel
Published: (2023)
Loops, Inverse Limits and Non-Determinism
by: Brattka, Vasco
Published: (2025)
by: Brattka, Vasco
Published: (2025)
Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)
by: Brattka, Vasco, et al.
Published: (2026)
Uniform Computability of PAC Learning
by: Brattka, Vasco, et al.
Published: (2026)
by: Brattka, Vasco, et al.
Published: (2026)
Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)
by: Brattka, Vasco, et al.
Published: (2024)
Computable topological groups
by: Koh, Heer Tern, et al.
Published: (2022)
by: Koh, Heer Tern, et al.
Published: (2022)
Evaluative presentations
by: McNicholl, Timothy H.
Published: (2024)
by: McNicholl, Timothy H.
Published: (2024)
A jump operator on the Weihrauch degrees
by: Andrews, Uri, et al.
Published: (2024)
by: Andrews, Uri, et al.
Published: (2024)
Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)
by: Lempp, Steffen, et al.
Published: (2023)
Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras
by: Eagle, Christopher, et al.
Published: (2025)
by: Eagle, Christopher, et al.
Published: (2025)
Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)
by: Hertling, Peter, et al.
Published: (2025)
Effective weak convergence and tightness of measures in computable Polish spaces
by: Rojas, Diego A.
Published: (2024)
by: Rojas, Diego A.
Published: (2024)
Reordered Computable Numbers
by: Janicki, Philip
Published: (2023)
by: Janicki, Philip
Published: (2023)
Computability for tree presentations of continuum-size structures
by: Block, Jason, et al.
Published: (2025)
by: Block, Jason, et al.
Published: (2025)
Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)
by: Hölzl, Rupert, et al.
Published: (2023)
Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)
by: Hölzl, Rupert, et al.
Published: (2024)
The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)
by: Hölzl, Rupert, et al.
Published: (2024)
Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, et al.
Published: (2024)
by: Lempp, Steffen, et al.
Published: (2024)
Computable Gelfand Duality
by: Burton, Peter, et al.
Published: (2024)
by: Burton, Peter, et al.
Published: (2024)
Computable analysis on the space of marked groups
by: Rauzy, Emmanuel
Published: (2021)
by: Rauzy, Emmanuel
Published: (2021)
A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025)
by: Badaev, Serikzhan, et al.
Published: (2025)
Computable Approximations of Semicomputable Graphs
by: Čačić, Vedran, et al.
Published: (2024)
by: Čačić, Vedran, et al.
Published: (2024)
Finding descending sequences through ill-founded linear orders
by: Goh, Jun Le, et al.
Published: (2020)
by: Goh, Jun Le, et al.
Published: (2020)
The weakness of finding descending sequences in ill-founded linear orders
by: Goh, Jun Le, et al.
Published: (2024)
by: Goh, Jun Le, et al.
Published: (2024)
Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)
by: Pradic, Cécilia, et al.
Published: (2026)
Computably discrete represented spaces
by: Neumann, Eike, et al.
Published: (2025)
by: Neumann, Eike, et al.
Published: (2025)
Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)
by: Hertling, Peter, et al.
Published: (2023)
The Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, et al.
Published: (2024)
by: Marcone, Alberto, et al.
Published: (2024)
Sequential discontinuity and first-order problems
by: Pauly, Arno, et al.
Published: (2024)
by: Pauly, Arno, et al.
Published: (2024)
The Weihrauch lattice at the level of $\boldsymbolΠ_1^1\mathsf{-CA}_0$: the Cantor-Bendixson theorem
by: Cipriani, Vittorio, et al.
Published: (2022)
by: Cipriani, Vittorio, et al.
Published: (2022)
Remarks and problems about algorithmic descriptions of groups
by: Rauzy, Emmanuel
Published: (2021)
by: Rauzy, Emmanuel
Published: (2021)
Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)
by: Pradic, Cécilia, et al.
Published: (2025)
Countable Ordered Groups and Weihrauch Reducibility
by: Li, Ang
Published: (2024)
by: Li, Ang
Published: (2024)
Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
by: Sorg, Christopher
Published: (2026)
by: Sorg, Christopher
Published: (2026)
The tree pigeonhole principle in the Weihrauch degrees
by: Dzhafarov, Damir, et al.
Published: (2023)
by: Dzhafarov, Damir, et al.
Published: (2023)
An effective version of the Stone duality
by: Bazhenov, Nikolay A., et al.
Published: (2026)
by: Bazhenov, Nikolay A., et al.
Published: (2026)
Computable thermodynamic formalism
by: Binder, Ilia, et al.
Published: (2025)
by: Binder, Ilia, et al.
Published: (2025)
Hausdorff dimension and countable Borel equivalence relations
by: Marks, Andrew, et al.
Published: (2024)
by: Marks, Andrew, et al.
Published: (2024)
Similar Items
-
Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025) -
New definitions in the theory of Type 1 computable topological spaces
by: Rauzy, Emmanuel
Published: (2023) -
A generalization of Markov's approach to the continuity problem for Type 1 computable functions
by: Rauzy, Emmanuel
Published: (2023) -
Loops, Inverse Limits and Non-Determinism
by: Brattka, Vasco
Published: (2025) -
Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)