Why Kolmogorov Complexity in Physical Equations?
نویسنده
چکیده
Several researchers, including M. Gell-Mann, argue that the notion of Kolmogorov complexity, developed in the algorithmic information theory, is useful in physics (i.e., in the description of the physical world). Their arguments are rather convincing, but there seems to be a gap between traditional physical equations and Kolmogorov complexity: namely, it is not clear how the standard equations of physics can lead to algorithmic notions underlying Kolmogorov complexity. In this paper, this \gap" is bridged: we explain how Kolmogorov complexity naturally appear in physical equation.
منابع مشابه
Toward Formalizing Non-Monotonic Reasoning in Physics: the Use of Kolmogorov Complexity to Formalize the Notions “Typically” and “Normally”
When a physicist writes down equations, or formulates a theory in any other terms, he or she usually means not only that these equations are true for the real world, but also that the model corresponding to the real world is “typical” among all the solutions of these equations. This type of argument is used when physicists conclude that some property is true by showing that it is true for “almo...
متن کاملToward Formalizing Non-Monotonic Reasoning in Physics: the Use of Kolmogorov Complexity
When a physicist writes down equations, or formulates a theory in any other terms, he or she usually means not only that these equations are true for the real world, but also that the model corresponding to the real world is “typical” among all the solutions of these equations. This type of argument is used when physicists conclude that some property is true by showing that it is true for “almo...
متن کاملIs Randomness "Native" to Computer Science?
1 From probability theory to Kolmogorov complexity 3 1.1 Randomness and Probability theory . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Intuition of finite random strings and Berry’s paradox . . . . . . . . . . . . 5 1.3 Kolmogorov complexity relative to a function . . . . . . . . . . . . . . . . . 6 1.4 Why binary programs? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.5...
متن کاملar X iv : 0 80 1 . 02 89 v 1 [ m at h . L O ] 1 J an 2 00 8 Is Randomness “ native ” to Computer Science ?
1 From probability theory to Kolmogorov complexity 3 1.1 Randomness and Probability theory . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Intuition of finite random strings and Berry’s paradox . . . . . . . . . . . . 5 1.3 Kolmogorov complexity relative to a function . . . . . . . . . . . . . . . . . 6 1.4 Why binary programs? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.5...
متن کاملToward Formalizing Non-Monotonic Reasoning in Physics: the Use of Kolmogorov Complexity and Algorithmic Information Theory to Formalize the Notions “Typically” and “Normally”
When a physicist writes down equations, or formulates a theory in any other terms, he usually means not only that these equations are true for the real world, but also that the model corresponding to the real world is “typical” among all the solutions of these equations. This type of argument is used when physicists conclude that some property is true by showing that it is true for “almost all”...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997