Image de couverture de livre

Variants of Solovay reducibility

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Titov, Ivan
Format:	Preprint
Publié:	2024
Sujets:	Logic Information Theory Logic in Computer Science 03D32 (Primary) 03D30, 68Q30 (Secondary)
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Solovay reducibility implies S2a-reducibility
par: Titov, Ivan
Publié: (2024)

A total Solovay reducibility and totalizing of the notion of speedability
par: Merkle, Wolfgang, et autres
Publié: (2024)

Extending the Limit Theorem of Barmpalias and Lewis-Pye to all reals
par: Titov, Ivan
Publié: (2024)

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

On the incomputability of computable dimension
par: Staiger, Ludwig
Publié: (2019)

Information vs Dimension -- an Algorithmic Perspective
par: Reimann, Jan
Publié: (2024)

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

There is a deep 1-generic set
par: Li, Ang
Publié: (2024)

Ramsey-like theorems for separable permutations
par: Houérou, Quentin Le, et autres
Publié: (2025)

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

Contrasting the Halves of an Ahmad Pair
par: Ravishankar, Karthik
Publié: (2025)

Introenumerability, autoreducibility, and randomness
par: Li, Ang
Publié: (2024)

$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
par: Cintioli, Patrizio
Publié: (2026)

A $Π^0_2$ Singleton of Minimal Arithmetic Degree
par: Gerdes, Peter
Publié: (2023)

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

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

On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
par: Song, Sirun, et autres
Publié: (2025)

A Minimal Substitution Basis for the Kalmár Elementary Functions
par: Prunescu, Mihai, et autres
Publié: (2025)

Iterated jump noncomputability and compactness
par: Dooley, Gavin
Publié: (2025)

The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
par: Harrington, Leo A., et autres
Publié: (2025)

The equational theory of the Weihrauch lattice with (iterated) composition
par: Pradic, Cécilia
Publié: (2024)

The equational theory of the Weihrauch lattice with multiplication
par: Neumann, Eike, et autres
Publié: (2024)

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
par: Kattermann, David, et autres
Publié: (2025)

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

The reverse mathematics of bounded Ramsey's theorem for pairs
par: Houérou, Quentin Le, et autres
Publié: (2025)

On Chaitin's Heuristic Principle and Halting Probability
par: Salehi, Saeed
Publié: (2023)

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

Algebraic Proof Theory for Infinitary Action Logic
par: Fussner, Wesley, et autres
Publié: (2025)

An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
par: Samra, Jean Abou, et autres
Publié: (2026)

Comparing Notions of Dense Computability on $ω^ω$ and $2^ω$
par: Gerdes, Peter M.
Publié: (2025)

Axiom Beta Implies Elementary Transfinite Recursion
par: Frittaion, Emanuele, et autres
Publié: (2026)

Conjunctive reducibilities and completeness
par: Chitaia, Irakli, et autres
Publié: (2026)

A note on the degree structure of primitive recursive m-reducibility
par: Kalmurzayev, Birzhan, et autres
Publié: (2023)

Finitely Bounded Homogeneity Turned Inside-Out
par: Rydval, Jakub
Publié: (2021)

Learning Equivalence Relations on Polish Spaces
par: Rossegger, Dino, et autres
Publié: (2024)

The adjacent Hindman's theorem and the $\mathbb Z$-Ramsey's theorem
par: Aceves-Martínez, Bruno Fernando, et autres
Publié: (2024)

A $wtt$-introimmune set in \texorpdfstring{$Π^0_1$}{Pi01} and introimmunity for several reducibilities
par: Cintioli, Patrizio
Publié: (2026)

A Logspace Constructive Proof of L=SL
par: Buss, Sam, et autres
Publié: (2025)

There is No Composition in the Computable Reducibility Degrees
par: Mourad, Daniel
Publié: (2024)

Why the classes P and NP are not well-defined finitarily
par: Anand, Bhupinder Singh
Publié: (2024)