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 κ
CITATION STYLE
Galeotti, L., & Nobrega, H. (2017). Towards computable analysis on the generalised real line. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10307 LNCS, pp. 246–257). Springer Verlag. https://doi.org/10.1007/978-3-319-58741-7_24
Mendeley helps you to discover research relevant for your work.