Algorithmic Relative Complexity

Information content and compression are tightly related concepts that can be addressed through both classical and algorithmic information theories, on the basis of Shannon entropy and Kolmogorov complexity, respectively. The definition of several entities in Kolmogorov’s framework relies upon ideas...

詳細記述

書誌詳細

主要な著者:	Daniele Cerra, Mihai Datcu
フォーマット:	Artigo
言語:	Inglês
出版事項:	MDPI AG 2011-04-01
シリーズ:	Entropy
主題:	Kolmogorov complexity compression relative entropy Kullback-Leibler divergence similarity measure compression based distance
オンライン･アクセス:	http://www.mdpi.com/1099-4300/13/4/902/
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!