Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on Kolmogorov complexity and entropy

From MaRDI portal
Publication:1431991
Jump to:navigation, search

DOI10.1016/S0893-9659(03)90105-4zbMath1044.94516MaRDI QIDQ1431991

Yasuichi Horibe

Publication date: 11 June 2004

Published in: Applied Mathematics Letters (Search for Journal in Brave)


zbMATH Keywords

Kolmogorov complexityEntropy rateErgodic source


Mathematics Subject Classification ID

Measures of information, entropy (94A17)


Related Items (1)

An operational characterization of mutual information in algorithmic information theory




Cites Work

  • Unnamed Item
  • Some equivalences between Shannon entropy and Kolmogorov complexity




This page was built for publication: A note on Kolmogorov complexity and entropy

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1431991&oldid=13605612"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 18:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki