Kolmogorov Complexity, Causality And Spin
نویسنده
چکیده
A novel topological and computational method for ‘motion’ is described. Motion is constrained by inequalities in terms of Kolmogorov Complexity. Causality is obtained as the output of a high-pass filter, passing through only high values of Kolmogorov Complexity. Motion under the electromagnetic field described with immediate relationship with G2 Holonomy group and its corresponding dense free 2-subgroup. Similar to Causality, Spin emerges as an immediate and inevitable consequence of high values of Kolmogorov Complexity. Consequently, the physical laws are nothing but a low-pass filter for small values of Kolmogorov Complexity.
منابع مشابه
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits
Symmetry of information states that C(x) + C(y|x) = C(x, y) + O(logC(x)). In [3] an online variant of Kolmogorov complexity is introduced and we show that a similar relation does not hold. Let the even (online Kolmogorov) complexity of an n-bitstring x1x2 . . . xn be the length of a shortest program that computes x2 on input x1, computes x4 on input x1x2x3, etc; and similar for odd complexity. ...
متن کاملCausal Markov Condition for Submodular Information Measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a causal hypothesis in terms of a directed acyclic graph. In the conventional setting, the observations are random variables and the independence is a statistical one, i.e., the information content of observations is measur...
متن کاملQuantum Kolmogorov Complexity and Information-Disturbance Theorem
In this paper, a representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by P. Vitányi has been examined. In the quantum information theory, the information-disturbance relationship, which treats the trade-off relationship between information gain and its caused disturbance, is a fundamental result that is related to Heisenberg’s uncerta...
متن کاملSymmetry of Information: A Closer Look
Symmetry of information establishes a relation between the information that x has about y (denoted I(x : y)) and the information that y has about x (denoted I(y : x)). In classical information theory, the two are exactly equal, but in algorithmical information theory, there is a small excess quantity of information that differentiates the two terms, caused by the necessity of packaging informat...
متن کاملResolution of Singularities and Stochastic Complexity of Complete Bipartite Graph-Type Spin Model in Bayesian Estimation
In this paper, we obtain the main term of the average stochastic complexity for certain complete bipartite graph-type spin models in Bayesian estimation. We study the Kullback function of the spin model by using a new method of eigenvalue analysis first and use a recursive blowing up process for obtaining the maximum pole of the zeta function which is defined by using the Kullback function. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1204.5447 شماره
صفحات -
تاریخ انتشار 2012