K-trivials are NCR
From MaRDI portal
Publication:6211902
arXiv0812.1600MaRDI QIDQ6211902
Theodore A. Slaman, Antonio Montalbán
Publication date: 8 December 2008
Abstract: We show that for every K-trivial real X, there is no representation of a continuous probability measure m such that X is 1-random relative to m.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28)
This page was built for publication: K-trivials are NCR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6211902)
