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

On common information

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

DOI10.1016/S0304-3975(98)00070-XzbMath0912.68079MaRDI QIDQ1275006

Andrej A. Muchnik

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

algorithmic information theoryKolmogorov entropycommon information of two words


Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)


Related Items

Stability of properties of Kolmogorov complexity under relativization, An operational characterization of mutual information in algorithmic information theory, Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\), On common information



Cites Work

  • On common information
  • THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1275006&oldid=13373251"
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 10:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki