Order:
  1.  22
    Model-theoretic complexity of automatic structures.Bakhadyr Khoussainov & Mia Minnes - 2010 - Annals of Pure and Applied Logic 161 (3):416-426.
  2.  51
    Probabilistic algorithmic randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
    We introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness. Our characterization of ML-randomness partially addresses a critique of Schnorr by formulating ML randomness in terms of a computable process rather than a computably enumerable function.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  3. Several papers on automatic randomness.Mia Minnes - 2012 - Bulletin of Symbolic Logic 18 (4):579.
  4.  17
    Jeffrey Shallit and Ming-Wei Wang. Automatic complexity of strings. Journal of Automata, Languages and Combinatorics, vol. 6 , pp. 537–554. - Cristian S. Calude, Kai Salomaa and Tania K. Roblot. Finite-state complexity and randomness. Theoretical Computer Science, vol. 412 , no. 41, pp. 5668–5677. - Cristian S. Calude, Kai Salomaa and Tania K. Roblot. State-size hierarchy for finite-state complexity. International Journal of Foundations of Computer Science, vol. 23 , no. 1, pp. 37–50. [REVIEW]Mia Minnes - 2012 - Bulletin of Symbolic Logic 18 (4):579-580.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark