The basic theory of infinite time register machines. - Merlin Carl; Tim Fischbach; Peter Koepke; Russell G. Miller; Miriam Nasfi; Gregor Weckbecker (Arch. Math. Log., 2010)

A Computational Approach to an Alternative Working Environment for the Constructible Universe. - Merlin Carl (CiE, 2011)

Algorithmic Randomness for Infinite Time Register Machines. - Merlin Carl (CiE, 2014)

The distribution of ITRM-recognizable reals. - Merlin Carl (Ann. Pure Appl. Log., 2014)

ITRM I T R M -Recognizability from Random Oracles. - Merlin Carl (CiE, 2015)

Optimal Results on Recognizability for Infinite Time Register Machines. - Merlin Carl (J. Symb. Log., 2015)

Generalized Effective Reducibility. - Merlin Carl (CiE, 2016)

Randomness and degree theory for infinite time register machines. - Merlin Carl (Comput., 2016)

Admissibles in Gaps. - Merlin Carl; Bruno Durand 001; Grégory Lafitte; Sabrina Ouazzani (CiE, 2017)

Koepke Machines and Satisfiability for Infinitary Propositional Languages. - Merlin Carl; Benedikt Löwe; Benjamin G. Rin (CiE, 2017)

The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. - Merlin Carl; Philipp Schlicht (CiE, 2017)

Infinite time recognizability from generic oracles and the recognizable jump operator. - Merlin Carl (Comput., 2017)

Infinite Computations with Random Oracles. - Merlin Carl; Philipp Schlicht (Notre Dame J. Formal Log., 2017)

Some Observations on Infinitary Complexity. - Merlin Carl (CiE, 2018)

Taming Koepke's Zoo. - Merlin Carl; Sabrina Ouazzani; Philip D. Welch (CiE, 2018)

Recognizable sets and Woodin cardinals: computation beyond the constructible universe. - Merlin Carl; Philipp Schlicht; Philip D. Welch (Ann. Pure Appl. Log., 2018)

Writability and reachability for alpha-tape infinite time Turing machines. - Merlin Carl; Benjamin G. Rin; Philipp Schlicht (CoRR, 2018)

A transfer principle for second-order arithmetic, and applications. - Merlin Carl; Asgar Jamneshan (J. Log. Anal., 2018)

Randomness via Infinite Computation and Effective Descriptive Set Theory. - Merlin Carl; Philipp Schlicht (J. Symb. Log., 2018)

Clockability for Ordinal Turing Machines. - Merlin Carl (CiE, 2020)

Using Automated Theorem Provers for Mistake Diagnosis in the Didactics of Mathematics. - Merlin Carl (CoRR, 2020)

Number Theory and Axiomatic Geometry in the Diproche System. - Merlin Carl (ThEdu@IJCAR, 2020)

Automatized Evaluation of Formalization Exercises in Mathematics. - Merlin Carl (CoRR, 2020)

Decision times of infinite computations. - Merlin Carl; Philipp Schlicht; Philip D. Welch (CoRR, 2020)

Reachability for infinite time Turing machines with long tapes. - Merlin Carl; Benjamin G. Rin; Philipp Schlicht (Log. Methods Comput. Sci., 2020)

Space and time complexity for infinite time Turing machines. - Merlin Carl (J. Log. Comput., 2020)

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines. - Merlin Carl (CiE, 2021)

Randomising Realizability. - Merlin Carl; Lorenzo Galeotti; Robert Paßmann (CiE, 2021)

Effectivity and reducibility with ordinal Turing machines. - Merlin Carl (Comput., 2021)

Natural Language Proof Checking in Introduction to Proof Classes - First Experiences with Diproche. - Merlin Carl; Hinrich Lorenzen; Michael Schmitz 005 (ThEdu@CADE, 2021)

Models of true arithmetic are integer parts of models of real exponentation. - Merlin Carl; Lothar Sebastian Krapp (J. Log. Anal., 2021)

Lower Bounds on β (α ). - Merlin Carl (CiE, 2022)

Taming Koepke's Zoo II: Register machines. - Merlin Carl (Ann. Pure Appl. Log., 2022)

Space-bounded OTMs and REG∞. - Merlin Carl (Comput., 2022)

All Melodies Are Lost - Recognizability for Weak and Strong α-Register Machines. - Merlin Carl (CiE, 2023)

Improving the Diproche CNL through autoformalization via GPT-3. - Merlin Carl (ThEdu@CADE, 2023)

Using large language models for (de-)formalization and natural argumentation exercises for beginner's students. - Merlin Carl (ThEdu@CADE, 2023)

Realisability for infinitary intuitionistic set theory. - Merlin Carl; Lorenzo Galeotti; Robert Paßmann (Ann. Pure Appl. Log., 2023)

Almost Sure OTM-Realizability. - Merlin Carl (CiE, 2024)

Lower bounds on β(α) and other properties of α-register machines. - Merlin Carl (Comput., 2024)

Full Generalized Effective Reducibility. - Merlin Carl (CiE, 2025)