1 citations · 1 across the 6 of their papers we have counts for
6 papers
Symmetry for transfinite computability
Lorenzo Galeotti, Ethan S. Lewis, Benedikt Löwe
Finite Turing computation has a fundamental symmetry between inputs, outputs, programs, time, and storage space. Standard models of transfinite computational break this symmetry; w…
Randomising Realisability
Merlin Carl, Lorenzo Galeotti, Robert Passmann
We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positiv…
Realisability for Infinitary Intuitionistic Set Theory
Merlin Carl, Lorenzo Galeotti, Robert Passmann
We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sou…
Bounded Symbiosis and Upwards Reflection
Lorenzo Galeotti, Yurii Khomskii, Jouko Väänänen
Bagaria and Väänänen developed a framework for studying the large cardinal strength of downwards Löwenheim-Skolem theorems and related set theoretic reflection properties. The main…
Resetting Infinite Time Blum-Shub-Smale-Machines
Merlin Carl, Lorenzo Galeotti
In this paper, we study strengthenings of Infinite Times Blum-Shub-Smale-Machines (ITBMs) that were proposed by Seyfferth in [14] and Welch in [15] obtained by modifying the behavi…
Towards computable analysis on the generalised real line
Lorenzo Galeotti, Hugo Nobrega
In this paper we use infinitary Turing machines with tapes of length and which run for time as presented, e.g., by Koepke \& Seyfferth, to generalise the notion of type two…