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

Kolmogorov complexity and non-determinism

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

DOI10.1016/S0304-3975(01)00038-XzbMath0982.68076MaRDI QIDQ5958289

Jean-Yves Marion, Serge Grigorieff

Publication date: 3 March 2002

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


zbMATH Keywords

Kolmogorov complexity


Mathematics Subject Classification ID

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





Cites Work

  • Randomness conservation inequalities; information and independence in mathematical theories
  • Kolmogorov and mathematical logic
  • A Theory of Program Size Formally Identical to Information Theory
  • Instance complexity
  • Relations between varieties of kolmogorov complexities
  • A variant of the Kolmogorov concept of complexity
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Kolmogorov complexity and non-determinism

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