10 citations · 82 across the 40 of their papers we have counts for
4 papers · 1 filter
Models of true arithmetic are integer parts of nice real closed fields
Merlin Carl
Exploring further the connection between exponentiation on real closed fields and the existence of an integer part modelling strong fragments of arithmetic, we demonstrate that eac…
Towards a Church-Turing-Thesis for Infinitary Computations
Merlin Carl
We consider the question whether there is an infinitary analogue of the Church-Turing-thesis. To this end, we argue that there is an intuitive notion of transfinite computability a…
Infinite computations with random oracles
Merlin Carl, Philipp Schlicht
We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive mea…
Optimal Results on ITRM-recognizability
Merlin Carl
Exploring further the properties of ITRM-recognizable reals, we provide a detailed analysis of recognizable reals and their distribution in Gödels constructible universe L. In part…