Cover Image

Toward higher-order infinite time Turing machines: simulational $Γ$-machines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bournez, Olivier, Finkel, Olivier, Girardot, Johan
Format:	Preprint
Published:	2025
Subjects:	Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
by: Blanc, Manon, et al.
Published: (2023)

Measuring robustness of dynamical systems. Relating time and space to length and precision
by: Blanc, Manon, et al.
Published: (2023)

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
by: Bournez, Olivier
Published: (2026)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
by: Bournez, Olivier, et al.
Published: (2026)

Wadge degrees of $Δ^0_2$ omega-powers
by: Finkel, Olivier, et al.
Published: (2024)

The domino problem is decidable for robust tilesets
by: Aubrun, Nathalie, et al.
Published: (2024)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
by: Bournez, Olivier, et al.
Published: (2024)

Set Descriptive Complexity of Solvable Functions
by: Gozzi, Riccardo, et al.
Published: (2024)

Wadge degrees of Δ20$\mathbf{\Delta }^0_2$ omega‐powers
by: Olivier Finkel, et al.
Published: (2024)

The strange world of transfinite Melodies -- Recognizability for weak and strong infinite time $α$-register machines
by: Carl, Merlin
Published: (2022)

Turing machines deciders, part I
by: The bbchallenge Collaboration, et al.
Published: (2025)

The subTuring degrees
by: Kihara, Takayuki, et al.
Published: (2024)

Incompleteness theorems via Turing category
by: Savelyev, Yasha
Published: (2024)

Did Turing prove the undecidability of the halting problem?
by: Hamkins, Joel David, et al.
Published: (2024)

Turing Degrees of Hyperjumps
by: Jananthan, Hayden R., et al.
Published: (2021)

Uncountable sets and an infinite linear order game
by: Matos-Wiederhold, Tonatiuh, et al.
Published: (2024)

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)

Effectivity and Reducibility with Ordinal Turing Machines
by: Carl, Merlin
Published: (2018)

An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
by: Samra, Jean Abou, et al.
Published: (2026)

Parameterized complexity of n-dense modal logics
by: Gasquet, Olivier
Published: (2026)

Groups with infinite linearly ordered products
by: Bagayoko, Vincent
Published: (2024)

A Note on Clockability for Ordinal Turing Machines
by: Carl, Merlin
Published: (2019)

Complete and tractable machine-independent characterizations of second-order polytime
by: Hainry, Emmanuel, et al.
Published: (2022)

Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)

Branch-Well-Structured Transition Systems and Extensions
by: Bollig, Benedikt, et al.
Published: (2022)

The category of well-filtered dcpos is not $Γ$-faithful
by: Miao, Hualin, et al.
Published: (2024)

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
by: Carl, Merlin
Published: (2024)

Common Knowledge, Sailboats, and Publicity
by: Bozdag, Sena, et al.
Published: (2025)

Type Isomorphisms for Multiplicative-Additive Linear Logic
by: Di Guardia, Rémi, et al.
Published: (2024)

The complexity of computing in continuous time: space complexity is precision
by: Blanc, Manon, et al.
Published: (2024)

Towards Constraint Temporal Answer Set Programming
by: Cabalar, Pedro, et al.
Published: (2025)

On the Satisfiability of Local First-Order Logics with Data
by: Bollig, Benedikt, et al.
Published: (2023)

Fagin's Theorem for Semiring Turing Machines
by: Badia, Guillermo, et al.
Published: (2025)

Constructive higher sheaf models with applications to synthetic mathematics
by: Coquand, Thierry, et al.
Published: (2026)

Semantics for a Turing-complete Reversible Programming Language with Inductive Types
by: Chardonnet, Kostia, et al.
Published: (2023)

RA: A machine based rational agent, Part 1
by: Pantelis, G.
Published: (2024)

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
by: André, Étienne, et al.
Published: (2023)

Unavoidable structures in infinite tournaments
by: Benford, Alistair, et al.
Published: (2023)

Non-trivial higher homotopy of first-order theories
by: Campion, Tim, et al.
Published: (2023)

Finite final segments of the d.c.e. Turing degrees
by: Lempp, Steffen, et al.
Published: (2024)