Cover Image

A non-computable c.e. closed subset of $[0,1]$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Badaev, Serikzhan, Bazhenov, Nikolay, Goncharov, Sergey, Kalmurzayev, Birzhan, Melnikov, Alexander
Format:	Preprint
Published:	2025
Subjects:	Logic 03D78 (Primary) 03D45, 03C57 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computability for tree presentations of continuum-size structures
by: Block, Jason, et al.
Published: (2025)

A note on the degree structure of primitive recursive m-reducibility
by: Kalmurzayev, Birzhan, et al.
Published: (2023)

New definitions in the theory of Type 1 computable topological spaces
by: Rauzy, Emmanuel
Published: (2023)

Online and feasible presentability: from trees to modal algebras
by: Bazhenov, Nikolay, et al.
Published: (2025)

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

Isomorphism Spectra and Computably Composite Structures
by: Lakerdas-Gayle, Joey
Published: (2025)

Computable Gelfand Duality
by: Burton, Peter, et al.
Published: (2024)

On the computability of cofinal Fraïssé limits
by: Ackerman, Nathanael, et al.
Published: (2026)

Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, 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)

The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)

On Cohesive Products of Fields
by: Dimitrov, Rumen, et al.
Published: (2026)

Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)

An effective version of the Stone duality
by: Bazhenov, Nikolay A., et al.
Published: (2026)

Computable topological groups
by: Koh, Heer Tern, et al.
Published: (2022)

A jump operator on the Weihrauch degrees
by: Andrews, Uri, et al.
Published: (2024)

Strong reducibilities and set theory
by: Schweber, Noah
Published: (2024)

Scott sentence complexities of linear orderings
by: Gonzalez, David, et al.
Published: (2023)

Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)

Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)

Computability in infinite Galois theory and algorithmically random algebraic fields
by: Calvert, Wesley, et al.
Published: (2023)

Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)

Computable Bases
by: Brattka, Vasco, et al.
Published: (2025)

Evaluative presentations
by: McNicholl, Timothy H.
Published: (2024)

Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)

Clarifying ordinals
by: Schweber, Noah
Published: (2024)

A Counterexample Regarding C.E. Closed Subsets of [0,1] Under Homeomorphisms
by: Bosserhoff, Volker
Published: (2025)

A $Π^0_2$ Singleton of Minimal Arithmetic Degree
by: Gerdes, Peter
Published: (2023)

Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)

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

The Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, et al.
Published: (2024)

Extensions of categoricity relative to a degree
by: Villano, Java Darleen
Published: (2025)

Hallucination, abstention, and computable inseparability
by: Imamura, Takuma
Published: (2026)

Algorithmic aspects of left-orderings of solvable Baumslag--Solitar groups via its dynamical realization
by: Ho, Meng-Che "Turbo", et al.
Published: (2024)

Punctually Standard and Nonstandard Models of Natural Numbers
by: Bazhenov, Nikolay, et al.
Published: (2026)

Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)

Automatic structures and the problem of natural well-orderings
by: Beklemishev, Lev D., et al.
Published: (2024)

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)

Analysis of HOD for Admissible Structures
by: Kruschewski, Jan, et al.
Published: (2025)

Countable Ordered Groups and Weihrauch Reducibility
by: Li, Ang
Published: (2024)