Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Why Kolmogorov complexity?

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

DOI10.1007/978-94-010-0920-1_5zbMATH Open1333.68151OpenAlexW154787412MaRDI QIDQ2797264

V. A. Uspenskiĭ

Publication date: 5 April 2016

Published in: Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-94-010-0920-1_5




Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Information theory (general) (94A15)








This page was built for publication: Why Kolmogorov complexity?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2797264)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2797264&oldid=15692671"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 18:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki