3 ms·
Kolmogorov / Chaitin complexity. A measure of the simplicity which a given pattern (program output) can be represented. A question that will get the applied mat
by derrida 15y ago
Kolmogorov / Chaitin complexity. A measure of the simplicity which a given pattern (program output) can be represented. A question that will get the applied math majors going -> Is Kolmogorov complexity a good measure of the generality of a physical law or mathematical theorem?