Revision as of 10:14, 9 February 2025 edit WikiCleanerBot (talk \| contribs) Bots 1,007,735 edits m v2.05b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation) Tag: WPCleaner ← Previous edit		Revision as of 13:13, 2 March 2025 edit undo 14.139.38.137 (talk) →Chain rule for Kolmogorov complexity Tag: Reverted Next edit →
Line 248: :''K''(''X'',''Y'') = ''K''(''X'') + ''K''(''Y''\|''X'') + c*max(1,log(''K''(''X'',''Y''))). It states that the shortest program that reproduces ''X'' and ''Y'' is [[Big-O notation\|no more]] than a logarithmic term larger than a program to reproduce ''X'' and a program to reproduce ''Y'' given ''X''. Using this statement, one can define [[Mutual information#Absolute mutual information\|an analogue of mutual information for Kolmogorov complexity]]. ljn ==Compression==

Kolmogorov complexity: Difference between revisions