We consider various ways to represent irrational numbers by subrecursive functions: via Cauchy sequences, Dedekind cuts, trace functions, several variants of sum approximations and continued fractions. Let be a class of subrecursive functions. The set of irrational numbers that can be obtained with functions from depends on the representation. We compare the sets obtained by the different representations.
I.Georgiev, Continued fractions of primitive recursive real numbers, Mathematical Logic Quarterly61(4–5) (2015), 288–306. doi:10.1002/malq.201400013.
4.
A.Y.Khintchine, Continued Fractions, P. Noordhoff, Ltd, Groningen, The Netherlands, 1963. (Translated by Peter Wynn.)
5.
K.Ko, On the definitions of some complexity classes of real numbers, Mathematical Systems Theory16 (1983), 95–109. doi:10.1007/BF01744572.
6.
K.Ko, On the continued fraction representation of computable real numbers, Theoretical Computer Science47 (1986), 299–313. doi:10.1016/0304-3975(86)90154-4.
7.
L.Kristiansen, Information content and computational complexity of recursive sets, in: Gödel ’96, P.Hajek, ed., Springer Lecture Notes in Logic, Vol. 6, Springer-Verlag, Heidelberg, 1996, pp. 235–246.
8.
L.Kristiansen, Papers on subrecursion theory, Dr Scient Thesis, Research Report 217, Department of Informatics, University of Oslo, 1996. ISSN 0806-3036, ISBN 82-7368-130-0.
9.
L.Kristiansen, A jump operator on honest subrecursive degrees, Archive for Mathematical Logic37 (1998), 105–125. doi:10.1007/s001530050086.
10.
L.Kristiansen, Lown, highn, and intermediate subrecursive degrees, in: Combinatorics, Computation and Logic, C.S.Calude and M.J.Dinneen, eds, Springer, Singapore, 1999, pp. 286–300.
11.
L.Kristiansen, Subrecursive degrees and fragments of Peano arithmetic, Archive for Mathematical Logic40 (2001), 365–397. doi:10.1007/PL00003845.
12.
L.Kristiansen, R.Lubarsky, J.-C.Schlage-Puchta and A.Weiermann, On the structure of honest elementary degrees, in: The Infinity Project, S.Friedman, M.Koerwinen and M.Müller, eds, CRM Documents, Vol. 11, CRM (Centre de Recerca Matematica), 2012, pp. 255–279.
13.
L.Kristiansen, J.-C.Schlage-Puchta and A.Weiermann, Streamlined subrecursive degree theory, Annals of Pure and Applied Logic163 (2012), 698–716. doi:10.1016/j.apal.2011.11.004.
14.
C.Leary and L.Kristiansen, A Friendly Introduction to Mathematical Logic, 2nd edn, Milne Library, SUNY Geneseo, Geneseo, NY, 2015.
15.
R.S.Lehman, On primitive recursive real numbers, Fundamenta Mathematica49(2) (1961), 105–118.
16.
M.Machtey, Augmented loop languages and classes of computable functions, Journal of Computer and System Sciences6 (1972), 603–624. doi:10.1016/S0022-0000(72)80032-1.
17.
M.Machtey, The honest subrecursive classes are a lattice, Information and Control24 (1974), 247–263. doi:10.1016/S0019-9958(74)80039-2.
18.
M.Machtey, On the density of honest subrecursive classes, Journal of Computer and System Sciences10 (1975), 183–199. doi:10.1016/S0022-0000(75)80039-0.
19.
A.R.Meyer and D.M.Ritchie, A classification of the recursive functions, Zeitschrift für mathematische Logik und Grundlagen der Mathematik18 (1972), 71–82. doi:10.1002/malq.19720180405.
20.
C.D.Olds, Continued Fractions, New Mathematics Library, Mathematical Association of America, Random House, 1963.
21.
R.Péter, Rekursive Funktionen, Verlag der Ungarischen Akademie der Wissenschaften, Budapest, 1957. (English translation: Academic Press, New York, 1967.)
22.
H.E.Rose, Subrecursion. Functions and Hierarchies, Clarendon Press, Oxford, 1984.
