Next Article in Journal
Energy Conservation in Absorption Refrigeration Cycles Using DES as a New Generation of Green Absorbents
Next Article in Special Issue
Stock Market Volatility and Return Analysis: A Systematic Literature Review
Previous Article in Journal
Particle Swarm Contour Search Algorithm
Previous Article in Special Issue
On the Evidence of Thermodynamic Self-Organization during Fatigue: A Review
Open AccessReview

How Incomputable Is Kolmogorov Complexity?

1
The National Research Center for Mathematics and Computer Science in the Netherlands (CWI), 1098XG Amsterdam, The Netherlands
2
Department of Computer Science, University of Amsterdam, 1012 WX Amsterdam, The Netherlands
Entropy 2020, 22(4), 408; https://doi.org/10.3390/e22040408
Received: 19 February 2020 / Revised: 4 March 2020 / Accepted: 29 March 2020 / Published: 3 April 2020
(This article belongs to the Special Issue Review Papers for Entropy)
Kolmogorov complexity is the length of the ultimately compressed version of a file (i.e., anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed. We discuss the incomputability of Kolmogorov complexity, which formal loopholes this leaves us with, recent approaches to compute or approximate Kolmogorov complexity, which approaches are problematic, and which approaches are viable. View Full-Text
Keywords: Kolmogorov complexity; incomputability; feasibility Kolmogorov complexity; incomputability; feasibility
MDPI and ACS Style

Vitányi, P.M. How Incomputable Is Kolmogorov Complexity? Entropy 2020, 22, 408.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop