Initial segment complexities of randomness notions
Schnorr famously proved that Martin-Löf-randomness of a sequence A can be characterised via the complexity of A ʼs initial segments. Nies, Stephan and Terwijn as well as independently Miller showed that a set is 2-random (that is, Martin-Löf random relative to the halting problem K ) iff there i...
Saved in:
Main Authors: | Hölzl, Rupert, Kräling, Thorsten, Stephan, Frank, Wu, Guohua |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/103751 http://hdl.handle.net/10220/19262 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
Similar Items
-
Initial segment complexities of randomness notions
by: Hölzl, R., et al.
Published: (2014) -
Initial segment complexities of randomness notions
by: Hölzl, R., et al.
Published: (2014) -
On initial segment complexity and degrees of randomness
by: Miller, J.S., et al.
Published: (2014) -
Relativizations of randomness and genericity notions
by: Franklin, J.N.Y., et al.
Published: (2014) -
A new notion of weighted centers for semidefinite programming
by: Chua, Chek Beng.
Published: (2009)