Timeline for The minimal growth rate of the countable family of sequences
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2015 at 3:01 | review | Close votes | |||
| Nov 2, 2015 at 12:05 | |||||
| Oct 29, 2015 at 7:24 | vote | accept | Marko Erceg | ||
| Oct 28, 2015 at 22:46 | history | edited | user6096 | CC BY-SA 3.0 |
spelling
|
| Oct 28, 2015 at 20:21 | comment | added | Joel David Hamkins | A simple diagonalization like $y_n=x^{(n)}_n$ does not necessarily work---it may not go to $\infty$---since perhaps the original sequences $x^{(k)}$ only get large for values of $n$ much larger than $k$. But ultimately, the Hausdorff gaps are filled by a diagonalization procedure, as Andreas describes. | |
| Oct 28, 2015 at 19:42 | answer | added | Andreas Blass | timeline score: 8 | |
| Oct 28, 2015 at 18:18 | answer | added | Joel David Hamkins | timeline score: 4 | |
| Oct 28, 2015 at 18:10 | comment | added | Fan Zheng | Couldn't you just use diagonalization? | |
| Oct 28, 2015 at 17:48 | review | Close votes | |||
| Oct 28, 2015 at 21:08 | |||||
| Oct 28, 2015 at 16:50 | review | First posts | |||
| Oct 28, 2015 at 16:55 | |||||
| Oct 28, 2015 at 16:45 | history | asked | Marko Erceg | CC BY-SA 3.0 |