10 citations · 82 across the 40 of their papers we have counts for
4 papers · 1 filter
Effectivity and Reducibility with Ordinal Turing Machines
Merlin Carl
This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility,…
A transfer principle for second-order arithmetic, and applications
Merlin Carl, Asgar Jamneshan
In the theory of conditional sets, many classical theorems from areas such as functional analysis, probability theory or measure theory are lifted to a conditional framework, often…
Reachability for infinite time Turing machines with long tapes
Merlin Carl, Benjamin Rin, Philipp Schlicht
Infinite time Turing machine models with tape length , denoted , strengthen the machines of Hamkins and Kidder [HL00] with tape length . A new phenomenon is that for som…
Some Observations on Infinitary Complexity
Merlin Carl
Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, Löwe and the author, we prove the following results: (1) An analogue o…