Towards Computable Analysis on the Generalised Real Line

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 κ^<κ=κ. Then we start the study of the computational properties of R_κ, a real closed field extension of R of cardinality 2^κ, defined by the first author using surreal numbers and proposed as the candidate for generalising real analysis. In particular we introduce representations of R_κ under which the field operations are computable. Finally we show that this framework is suitable for generalising the classical Weihrauch hierarchy. In particular we start the study of the computational strength of the generalised version of the Intermediate Value Theorem.