Cover Image

Benign approximations and non-speedability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hölzl, Rupert, Janicki, Philip
Format:	Preprint
Published:	2023
Subjects:	Logic 03D32, 03D78, 03F60
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Reordered Computable Numbers
by: Janicki, Philip
Published: (2023)

Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
by: Huttegger, Simon M., et al.
Published: (2024)

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

Computable Approximations of Semicomputable Graphs
by: Čačić, Vedran, et al.
Published: (2024)

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

A total Solovay reducibility and totalizing of the notion of speedability
by: Merkle, Wolfgang, et al.
Published: (2024)

Fundamental sequences based on localization
by: Wilken, Gunnar
Published: (2024)

Generalizing Goodstein's theorem and Cichon's independence proof
by: Wilken, Gunnar
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)

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

A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025)

Proof-theoretic dilator and intermediate pointclasses
by: Jeon, Hanul
Published: (2025)

Computably discrete represented spaces
by: Neumann, Eike, et al.
Published: (2025)

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

On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
by: Song, Sirun, et al.
Published: (2025)

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

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

Induction on Dilators and Bachmann-Howard Fixed Points
by: Aguilera, Juan P., et al.
Published: (2024)

Introenumerability, autoreducibility, and randomness
by: Li, Ang
Published: (2024)

$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
by: Cintioli, Patrizio
Published: (2026)

Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, et al.
Published: (2024)

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

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

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

Listing the hyperarithmetical functions
by: Miller, Joseph S., et al.
Published: (2026)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

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 Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, et al.
Published: (2024)

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

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

Ramsey-like theorems for separable permutations
by: Houérou, Quentin Le, et al.
Published: (2025)

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

Axiom Beta Implies Elementary Transfinite Recursion
by: Frittaion, Emanuele, et al.
Published: (2026)

Schnorr Randomness and Effective Bayesian Consistency and Inconsistency
by: Huttegger, Simon M., et al.
Published: (2025)

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)