Timeline for Lower-semicomputable supermartingales with bounded increments
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2011 at 23:44 | comment | added | Vladimir Slepnev | You certainly haven't misunderstood the question. I'm embarrassed that I didn't think of this argument myself. Thanks! As for question 2, it means finding an X such that X(S) > Y(S) - C - epsilon*length(S) for a given epsilon > 0. | |
| Mar 17, 2011 at 23:10 | vote | accept | Vladimir Slepnev | ||
| Mar 17, 2011 at 22:06 | history | answered | Jason Rute | CC BY-SA 2.5 |