Towards computable analysis on the generalised real line
Lorenzo Galeotti, Hugo Nobrega · arXiv (Cornell University) · 2017
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 computability to $2^κ$, where $κ$ is an uncountable cardinal with $κ^{