:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brattka, Vasco, Rauzy, Emmanuel
Format:	Preprint
Publié:	2025
Sujets:	Logic 03D78
Accès en ligne:	https://arxiv.org/abs/2510.09850
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Effective bases and notions of effective second countability in computable analysis
par: Brattka, Vasco, et autres
Publié: (2025)

New definitions in the theory of Type 1 computable topological spaces
par: Rauzy, Emmanuel
Publié: (2023)

A generalization of Markov's approach to the continuity problem for Type 1 computable functions
par: Rauzy, Emmanuel
Publié: (2023)

Loops, Inverse Limits and Non-Determinism
par: Brattka, Vasco
Publié: (2025)

Computability of the Hahn-Banach Theorem Revisited
par: Brattka, Vasco, et autres
Publié: (2026)

Uniform Computability of PAC Learning
par: Brattka, Vasco, et autres
Publié: (2026)

Computability of Initial Value Problems
par: Brattka, Vasco, et autres
Publié: (2024)

Computable topological groups
par: Koh, Heer Tern, et autres
Publié: (2022)

Minimal covers in the Weihrauch degrees
par: Lempp, Steffen, et autres
Publié: (2023)

A jump operator on the Weihrauch degrees
par: Andrews, Uri, et autres
Publié: (2024)

Evaluative presentations
par: McNicholl, Timothy H.
Publié: (2024)

Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras
par: Eagle, Christopher, et autres
Publié: (2025)

Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
par: Hertling, Peter, et autres
Publié: (2025)

Computability for tree presentations of continuum-size structures
par: Block, Jason, et autres
Publié: (2025)

Effective weak convergence and tightness of measures in computable Polish spaces
par: Rojas, Diego A.
Publié: (2024)

Reordered Computable Numbers
par: Janicki, Philip
Publié: (2023)

Benign approximations and non-speedability
par: Hölzl, Rupert, et autres
Publié: (2023)

Randomness versus superspeedability
par: Hölzl, Rupert, et autres
Publié: (2024)

The computational content of multidimensional discontinuity
par: Hölzl, Rupert, et autres
Publié: (2024)

Computable analysis on the space of marked groups
par: Rauzy, Emmanuel
Publié: (2021)

Chains and antichains in the Weihrauch lattice
par: Lempp, Steffen, et autres
Publié: (2024)

Computable Gelfand Duality
par: Burton, Peter, et autres
Publié: (2024)

Computable Approximations of Semicomputable Graphs
par: Čačić, Vedran, et autres
Publié: (2024)

Finding descending sequences through ill-founded linear orders
par: Goh, Jun Le, et autres
Publié: (2020)

The weakness of finding descending sequences in ill-founded linear orders
par: Goh, Jun Le, et autres
Publié: (2024)

A non-computable c.e. closed subset of $[0,1]$
par: Badaev, Serikzhan, et autres
Publié: (2025)

Computably discrete represented spaces
par: Neumann, Eike, et autres
Publié: (2025)

Problems with fixpoints of polynomials of polynomials
par: Pradic, Cécilia, et autres
Publié: (2026)

Sequential discontinuity and first-order problems
par: Pauly, Arno, et autres
Publié: (2024)

Regainingly approximable numbers and sets
par: Hertling, Peter, et autres
Publié: (2023)

The Galvin-Prikry Theorem in the Weihrauch lattice
par: Marcone, Alberto, et autres
Publié: (2024)

Remarks and problems about algorithmic descriptions of groups
par: Rauzy, Emmanuel
Publié: (2021)

The Weihrauch lattice at the level of $\boldsymbolΠ_1^1\mathsf{-CA}_0$: the Cantor-Bendixson theorem
par: Cipriani, Vittorio, et autres
Publié: (2022)

Weihrauch problems as containers
par: Pradic, Cécilia, et autres
Publié: (2025)

Countable Ordered Groups and Weihrauch Reducibility
par: Li, Ang
Publié: (2024)

Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
par: Sorg, Christopher
Publié: (2026)

The tree pigeonhole principle in the Weihrauch degrees
par: Dzhafarov, Damir, et autres
Publié: (2023)

An effective version of the Stone duality
par: Bazhenov, Nikolay A., et autres
Publié: (2026)

Computable thermodynamic formalism
par: Binder, Ilia, et autres
Publié: (2025)

Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
par: Huttegger, Simon M., et autres
Publié: (2024)