On the Subrecursive Computability of Several Famous Constants

: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-argument functions f, g and h in F such that for any n in N the distance between the rational number f(n) - g(n) over h(n) + 1 and the

• Type: Journal
• Year: 2008
• Where: JUCS
• Authors: Dimiter Skordev
• Keywords: F-computable Real Number, JUCS 2008, Real Number, Total Functions