Timeline for Absolutely algorithmically random infinite sequence
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 2, 2014 at 16:20 | comment | added | Joel David Hamkins | Yes, that's right. This kind of argument arises all over computability theory. | |
| Apr 2, 2014 at 7:14 | comment | added | Dan | Shortly, we sort all pairs $(g,h)$ and construct partial function $f$ step by step. At step $n$ we find big enough number $m$ and set $f(g_n(m)) = h_n(m) + 1$. In the end we just extend our partial function to total. Looks pretty straightforward :) | |
| Apr 2, 2014 at 0:21 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 50 characters in body
|
| Apr 2, 2014 at 0:10 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 259 characters in body
|
| Apr 1, 2014 at 23:52 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 47 characters in body
|
| Apr 1, 2014 at 23:47 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |