Turing Degrees of Hyperjumps
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | Jananthan, Hayden R., Simpson, Stephen G. |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
The subTuring degrees
par: Kihara, Takayuki, et autres
Publié: (2024)
par: Kihara, Takayuki, et autres
Publié: (2024)
Incompleteness theorems via Turing category
par: Savelyev, Yasha
Publié: (2024)
par: Savelyev, Yasha
Publié: (2024)
Did Turing prove the undecidability of the halting problem?
par: Hamkins, Joel David, et autres
Publié: (2024)
par: Hamkins, Joel David, et autres
Publié: (2024)
Effectivity and Reducibility with Ordinal Turing Machines
par: Carl, Merlin
Publié: (2018)
par: Carl, Merlin
Publié: (2018)
A Note on Clockability for Ordinal Turing Machines
par: Carl, Merlin
Publié: (2019)
par: Carl, Merlin
Publié: (2019)
Space and Time Complexity for Infinite Time Turing Machines
par: Carl, Merlin
Publié: (2019)
par: Carl, Merlin
Publié: (2019)
Equivalence and Conditional Independence in Atomic Sheaf Logic
par: Simpson, Alex
Publié: (2024)
par: Simpson, Alex
Publié: (2024)
Degrees of incomputability, realizability and constructive reverse mathematics
par: Kihara, Takayuki
Publié: (2020)
par: Kihara, Takayuki
Publié: (2020)
Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
par: Carl, Merlin
Publié: (2024)
par: Carl, Merlin
Publié: (2024)
Toward higher-order infinite time Turing machines: simulational $Γ$-machines
par: Bournez, Olivier, et autres
Publié: (2025)
par: Bournez, Olivier, et autres
Publié: (2025)
Fagin's Theorem for Semiring Turing Machines
par: Badia, Guillermo, et autres
Publié: (2025)
par: Badia, Guillermo, et autres
Publié: (2025)
Big Ramsey Degrees in Ultraproducts of Finite Structures
par: Bartošová, Dana, et autres
Publié: (2022)
par: Bartošová, Dana, et autres
Publié: (2022)
Degrees of the finite model property: the antidichotomy theorem
par: Bezhanishvili, Guram, et autres
Publié: (2023)
par: Bezhanishvili, Guram, et autres
Publié: (2023)
Semantics for a Turing-complete Reversible Programming Language with Inductive Types
par: Chardonnet, Kostia, et autres
Publié: (2023)
par: Chardonnet, Kostia, et autres
Publié: (2023)
Randomness and Degree Theory for Infinite Time Register Machines
par: Carl, Merlin
Publié: (2015)
par: Carl, Merlin
Publié: (2015)
Degree spectra of homeomorphism types of compact Polish spaces
par: Hoyrup, Mathieu, et autres
Publié: (2020)
par: Hoyrup, Mathieu, et autres
Publié: (2020)
Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
par: Blanc, Manon, et autres
Publié: (2023)
par: Blanc, Manon, et autres
Publié: (2023)
Finite final segments of the d.c.e. Turing degrees
par: Lempp, Steffen, et autres
Publié: (2024)
par: Lempp, Steffen, et autres
Publié: (2024)
A Relation on ${(ω, <)}$ of Intermediate Degree Spectrum on a Cone
par: Damaj, Jad, et autres
Publié: (2024)
par: Damaj, Jad, et autres
Publié: (2024)
An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
par: Samra, Jean Abou, et autres
Publié: (2026)
par: Samra, Jean Abou, et autres
Publié: (2026)
Expressivity of AuDaLa: Turing Completeness and Possible Extensions
par: Franken, Tom T. P., et autres
Publié: (2024)
par: Franken, Tom T. P., et autres
Publié: (2024)
Local-Order-Invariant Logic on Classes of Bounded Degree
par: Aoki, Derek
Publié: (2025)
par: Aoki, Derek
Publié: (2025)
Diagonalizing Through the $ω$-Chain: Iterated Self-Certification on Bounded Turing Machines and its Least Fixed Point
par: Sung, Miara
Publié: (2026)
par: Sung, Miara
Publié: (2026)
Kolmogorov Complexity of Attractive Degrees
par: Royer, Tiago
Publié: (2025)
par: Royer, Tiago
Publié: (2025)
Stochastic Process Turing Machines
par: Wolpert, David, et autres
Publié: (2024)
par: Wolpert, David, et autres
Publié: (2024)
Softmax Transformers are Turing-Complete
par: Jiang, Hongjian, et autres
Publié: (2025)
par: Jiang, Hongjian, et autres
Publié: (2025)
Degree-preserving Godel logics with an involution: intermediate logics and (ideal) paraconsistency
par: Coniglio, M. E., et autres
Publié: (2026)
par: Coniglio, M. E., et autres
Publié: (2026)
An Imperative Language for Verified Exact Real-Number Computation
par: Bauer, Andrej, et autres
Publié: (2024)
par: Bauer, Andrej, et autres
Publié: (2024)
FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree
par: Lohrey, Markus, et autres
Publié: (2025)
par: Lohrey, Markus, et autres
Publié: (2025)
A note reviewing Turing's 1936
par: Cattabriga, Paola
Publié: (2013)
par: Cattabriga, Paola
Publié: (2013)
Probabilistic Strategy Logic with Degrees of Observability
par: Mu, Chunyan, et autres
Publié: (2024)
par: Mu, Chunyan, et autres
Publié: (2024)
What If Turing Had Preceded Gödel?
par: Oberhoff, Sebastian
Publié: (2024)
par: Oberhoff, Sebastian
Publié: (2024)
$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
par: Cintioli, Patrizio
Publié: (2026)
par: Cintioli, Patrizio
Publié: (2026)
A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees
par: Cintioli, Patrizio
Publié: (2026)
par: Cintioli, Patrizio
Publié: (2026)
Martin's Conjecture in the Enumeration Degrees
par: Cordero, Antonio Nakid
Publié: (2025)
par: Cordero, Antonio Nakid
Publié: (2025)
There is No Composition in the Computable Reducibility Degrees
par: Mourad, Daniel
Publié: (2024)
par: Mourad, Daniel
Publié: (2024)
Tableau methodology for propositional logics
par: Jarmuzek, T., et autres
Publié: (2025)
par: Jarmuzek, T., et autres
Publié: (2025)
A note on Stone-Čech compactification in ZFA
par: Przybyłek, Michał R.
Publié: (2023)
par: Przybyłek, Michał R.
Publié: (2023)
On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
par: Song, Sirun, et autres
Publié: (2025)
par: Song, Sirun, et autres
Publié: (2025)
Degree of Kripke-incompleteness of Tense Logics
par: Chen, Qian
Publié: (2025)
par: Chen, Qian
Publié: (2025)
Documents similaires
-
The subTuring degrees
par: Kihara, Takayuki, et autres
Publié: (2024) -
Incompleteness theorems via Turing category
par: Savelyev, Yasha
Publié: (2024) -
Did Turing prove the undecidability of the halting problem?
par: Hamkins, Joel David, et autres
Publié: (2024) -
Effectivity and Reducibility with Ordinal Turing Machines
par: Carl, Merlin
Publié: (2018) -
A Note on Clockability for Ordinal Turing Machines
par: Carl, Merlin
Publié: (2019)