Talk:Algorithmically random sequence: Difference between revisions

Content deleted Content added
Kronocide (talk | contribs)
Line 30:
:Better? [[User:skeptical scientist|skeptical scientist]] ([[User talk:skeptical scientist|talk]]) 19:59, 8 September 2009 (UTC)
::Much, thanks! [[User:Kronocide|Kronocide]] ([[User talk:Kronocide|talk]]) 16:59, 10 September 2009 (UTC)
 
== About universality of martingale ==
 
There is a ''universal'' constructive martingale '''d'''. This martingale is universal in the sense that, given any constructive martingale ''d'', there is some constant ''λ''>0 so that for any string ''σ'', <math>\mathbf{d}(\sigma)\geq \lambda d(\sigma)</math>
 
This is the definition of ''optimal'' martingale and no c.e. martingale is optimal, see "Algorithmic randomness and complexity".