273 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Flensburg University of Applied SciencesDE5 papers
- University of Veterinary Medicine ViennaAT4 papers
- Charles Darwin UniversityAU3 papers
- Technical University of DenmarkDK3 papers
- Technische Hochschule IngolstadtDE3 papers
- University of South CarolinaUS3 papers
- Cornell UniversityUS2 papers
- ETH ZurichCH2 papers
- Forschungszentrum JülichDE2 papers
- Freie Universität BerlinDE2 papers
- Friedrich-Alexander-Universität Erlangen-NürnbergDE2 papers
- German Institute for Economic ResearchDE2 papers
Showing 2019 · math.LOShow all
3 papers · 2 filters
math.LO2019★ 1 cited
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…
math.LO2019★ 1 cited
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}…
math.LO2019★ 1 cited
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…