scientific article
From MaRDI portal
Publication:3224084
zbMATH Open1262.03066MaRDI QIDQ3224084
Publication date: 29 March 2012
Full work available at URL: http://ebooks.worldscinet.com/ISBN/9789814327756/9789814327756_0009.html
Title of this publication is not available (Why is that?)
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Characterising the Martin-Lรถf random sequences using computably enumerable sets of measure one ๐ ๐
- Stochastically recursive sequences and their generalizations ๐ ๐
- Martin-Lรถf randomness implies multiple recurrence in effectively closed sets ๐ ๐
- On semimeasures predicting Martin-Lรถf random sequences ๐ ๐
- Remarks on "Random Sequences" ๐ ๐
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224084)