Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

IFIPTCS
2010

favoriteEmaildiscussreport

130views Theoretical Computer Science» more IFIPTCS 2010»

Initial Segment Complexities of Randomness Notions

13 years 9 months ago

Initial Segment Complexities of Randomness Notions

Download hoelzl.fr

Schnorr famously proved that Martin-L

Rupert Hölzl, Thorsten Kräling, Frank St

Real-time Traffic

IFIPTCS 2010 | Martin-L¨of Random | Randomness | Schnorr Randomness | Theoretical Computer Science |

claim paper

Related Content

» Separations of Nonmonotonic Randomness Notions

» The Kolmogorov complexity of random reals

» Reconciling Data Compression and Kolmogorov Complexity

» SelfValidated Labeling of Markov Random Fields for Image Segmentation

» Multivariate Image Segmentation Using Semantic Region Growing With Adaptive Edge Penalty

» Derandomizing from Random Strings

» TimeBounded Kolmogorov Complexity and Solovay Functions

» Information measures for infinite sequences

» Unsupervised GrowCut Cellular AutomataBased Medical Image Segmentation

Post Info
More Details (n/a)

Added	13 Feb 2011
Updated	13 Feb 2011
Type	Journal
Year	2010
Where	IFIPTCS
Authors	Rupert Hölzl, Thorsten Kräling, Frank Stephan, Guohua Wu

Comments (0)