10 citations · 82 across the 40 of their papers we have counts for
4 papers · 1 filter
Taming Koepke's Zoo II: Register Machines
Merlin Carl
We study the computational strength of resetting -register machines, a model of transfinite computability introduced by P. Koepke in \cite{K1}. Specifically, we prove the follow…
A Note on Clockability for Ordinal Turing Machines
Merlin Carl
We study clockability for Ordinal Turing Machines (OTMs). In particular, we show that, in contrast to the situation for ITTMs, admissible ordinals can be OTM-clockable, that $Σ_{2}…
Space and Time Complexity for Infinite Time Turing Machines
Merlin Carl
We consider notions of space complexity for Infinite Time Turing Machines (ITTMs) that were introduced by B. Löwe and studied further by J. Winter. We answer several open questions…
A Note on OTM-Realizability and Constructive Set Theories
Merlin Carl
We define an ordinalized version of Kleene's realizability interpretation of intuitionistic logic by replacing Turing machines with Koepke's ordinal Turing machines (OTMs), thus ob…