Timeline for Simple example of a sequence without computable modulus of convergence
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 13, 2011 at 5:13 | comment | added | Jason | @Mateus: As a clarification, you probably mean before halting on input $0$. | |
| Jan 12, 2011 at 13:29 | vote | accept | Mateus Araújo | ||
| Jan 12, 2011 at 0:44 | comment | added | Mateus Araújo | Nice trick. To further simplify your example, just extend the domain of $f$ to the reals and make it continuous (by whatever method that leaves it monotonic). Then $a_k := \frac{1}{f^{-1}(k)}$, and the same argument applies. Also, a simpler example for $f(n)$ could be the busy beaver function, i.e., the maximum number of steps that a halting $n$-state Turing machine can perform before halting. | |
| Jan 11, 2011 at 23:43 | history | answered | Andreas Blass | CC BY-SA 2.5 |