Hill
- 783
- 600
- TL;DR
- There is a computable sequence of rational numbers with limit whose n-th binary digit is not a computable function of n
This is a proof of the above statement in Stillwell's "Reverse Mathematics", p.77:
My question is, how do we know that the sequence ##r_1, r_2, ...## converges?
My question is, how do we know that the sequence ##r_1, r_2, ...## converges?