2011/05/01 by Lev Sakhnovich, Sakhnovich, Lev
Computer Science · Physics and Astronomy · #03D32 #54C30 #68P30 #91A05 #Computability, Logic, AI Algorithms #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Information Theory (cs.IT) #Logic (math.LO) #Mathematical Physics (math-ph) #Probability (math.PR) #Statistical Mechanics and Entropy
paper · pdf · doi:10.48550/arxiv.1105.0208
openalex publication_date 2011/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Basic relations for the mean length and algorithmic entropy are obtained by solving a new extremal problem. Using this extremal problem, they are obtained in a most simple and general way. The length and entropy are considered as two players of a new type of a game, in which we follow the scheme of our previous work on thermodynamic characteristics in quantum and classical approaches.