Jump to content

Computable sequence of rationals with a noncomputable limit

Featured Replies

This is a proof of a statement in Stillwell's "Reverse Mathematics", p.77:

Screenshot 2026-01-20 120557.png

My question is, how do we know that the sequence [math]r_1, r_2, ...[/math] converges?

  • Author

The sequence [math]r_n=\sum_{i=1}^n 2^{-f(i)}[/math] is increasing and bounded, thus it converges.

Create an account or sign in to comment

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.