Abstract
A primitive-recursive sequence of rational numbers sn is said to be primitive-recursively irrational, if there are primitive recursive functions n(k), i(p, q) > 0 and N(p, q) such that:1. (k)(n ≥ n(k) → ∣sn – sn(k)∣ < 2−k).2. (p)(q)(q > 0 & n ≥ N(p, q) → ∣sn ± p/q∣ > 1/i(p, q)).The object of the present note is to establish the primitive-recursive irrationality of a sequence which converges to π. In a previous paper we proved the primitive-recursive irrationality of the exponential series Σxn/n!, for all rational values of x, and showed that a primitive-(general-) recursively irrational sequence sn is strongly primitive-(general-)recursive convergent in any scale, where a recursive sequence sn is said to be strongly primitive-(general-)recursive convergent in the scale r (r ≥ 2), if there is a non-decreasing primitive-(general-) recursive function r(k) such that,where [x] is the greatest integer contained in x, i.e. [x] = i if i ≤ x < i + 1, [x] = —i if i ≤ —x < i+1, where i is a non-negative integer.A rational recursive sequence sn is said to be recursive convergent, if there is a recursive function n(k) such that.If a sequence sn is strongly recursive convergent in a scale r, then it is recursive convergent and its limit is the recursive real number where, for any k ≥ 0,.
Publisher
Cambridge University Press (CUP)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Primitive recursive real numbers;MLQ;2007-09
2. Primitive Recursiveness of Real Numbers under Different Representations;Electronic Notes in Theoretical Computer Science;2007-01
3. Chapter 12 A bibliography of recursive analysis and recursive topology;Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory;1998
4. Recursion and iteration;Communications of the ACM;1965-02
5. Bibliography;Recursive Analysis;1961