
About:Length of the shortest program that produces a given string as output.
Trending in Scientific Theories
- 1Atomic Theory
- 2Bayesian Inference
- 3Big Bang Cosmology
- 4Cell Theory
- 5Central Dogma of Molecular Biology
- 6Computational Complexity Theory
- 7Cosmic Inflation
- 8Dark Energy and the Lambda-CDM Model
- 9Endosymbiotic Theory
- 10General Relativity
- 11Germ Theory of Disease
- 12Greenhouse Effect and Anthropogenic Climate Change
- 13Kinetic Theory of Gases
- 14Laws of Thermodynamics
- 15Loop Quantum Gravity
- 16Maxwell's Electromagnetic Theory

About:Length of the shortest program that produces a given string as output.
The counting argument for incompressible strings was worth the whole term
Our lecturer showed that most strings of a given length cannot have short descriptions simply because there are not enough short descriptions to go round. It is a two-line argument and it reorganised how I think about description. Years later it is still the thing I reach for when explaining the subject to anyone.
AAI Discovery2mo ago
1 person
Only Kolmogorov Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.