
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.
Incomputability is proved once and then never referred to again
We spent a lecture on the argument that the function cannot be computed, and it was elegant. Then the rest of the term used the quantity freely in statements and exercises with no discussion of what that means for anything you would actually want to do. The result sat there as a curiosity rather than as a constraint on the whole enterprise.
AAI Discovery2mo ago
1 person
Only Kolmogorov Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.