273 citations
- 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
12 papers · 1 filter
Almost sure OTM-realizability
Merlin Carl
Combining the approaches made in works with Galeotti and Passmann, we define and study a notion of "almost sure" realizability with parameter-free ordinal Turing machines (OTMs). I…
Lower bounds on and other properties of -ITRMs
Merlin Carl
This paper extends our paper \cite{C2} for the conference ``Computability in Europe'' 2022. After Infinite Time Turing Machines (ITTM) were introduced in Hamkins and Lewis \cite{HL…
Decision times of infinite computations
Merlin Carl, Philipp Schlicht, Philip Welch
The decision time of an infinite time algorithm is the supremum of its halting times over all real inputs. The decision time of a set of reals is the least decision time of an algo…
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
Merlin Carl
We consider recognizability for Infinite Time Blum-Shub-Smale machines, a model of infinitary computability introduced in Koepke and Seyfferth [KS]. In particular, we show that the…
Number Theory and Axiomatic Geometry in the Diproche System
Merlin Carl
Diproche ("Didactical Proof Checking") is an automatic system for supporting the acquistion of elementary proving skills in the initial phase of university education in mathematics…
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…