An announce of results linking Kolmogorov complexity to entropy for amenable group actions
    
    
  
  
  
      
      
      
        
Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XXIX, Tome 468 (2018), pp. 7-12
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			We announce a generalization of Brudno's results on the relation between the Kolmogorov complexity and the entropy of a subshift for actions of computable amenable groups.
			
            
            
            
          
        
      @article{ZNSL_2018_468_a0,
     author = {A. V. Alpeev},
     title = {An announce of results linking {Kolmogorov} complexity to entropy for amenable group actions},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {7--12},
     publisher = {mathdoc},
     volume = {468},
     year = {2018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2018_468_a0/}
}
                      
                      
                    A. V. Alpeev. An announce of results linking Kolmogorov complexity to entropy for amenable group actions. Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XXIX, Tome 468 (2018), pp. 7-12. http://geodesic.mathdoc.fr/item/ZNSL_2018_468_a0/