American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
|
AMS eContent Search Results
Matches for: msc=(68Q30) AND publication=(tran)
Sort order: Date
Format: Standard display

  
Results: 1 to 4 of 4 found      Go to page: 1

[1] Adam R. Day and Joseph S. Miller. Randomness for non-computable measures. Trans. Amer. Math. Soc. 365 (2013) 3575-3591.
Abstract, references, and article information
View Article: PDF

[2] Adam R. Day. Increasing the gap between descriptional complexity and algorithmic probability. Trans. Amer. Math. Soc. 363 (2011) 5577-5604. MR 2813425.
Abstract, references, and article information
View Article: PDF

[3] Bjørn Kjos-Hanssen, Wolfgang Merkle and Frank Stephan. Kolmogorov complexity and the Recursion Theorem. Trans. Amer. Math. Soc. 363 (2011) 5465-5480. MR 2813422.
Abstract, references, and article information
View Article: PDF

[4] Joseph S. Miller and Liang Yu. On initial segment complexity and degrees of randomness. Trans. Amer. Math. Soc. 360 (2008) 3193-3210. MR 2379793.
Abstract, references, and article information
View Article: PDF


Results: 1 to 4 of 4 found      Go to page: 1



AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia