相关论文: Kolmogorov Complexity, String Information, Pansper…
In this paper, a representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by P. Vitanyi has been examined. In the quantum information theory, the information-disturbance relationship,…
In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT^2C^2) satisfying the following requirements:…
The existence of intelligent, interstellar traveling and colonising life is a key assumption behind the Fermi Paradox. Until recently, detecting signs of life elsewhere has been so technically challenging as to seem almost impossible.…
Complexity is a fundamental characteristic of states within a quantum system. Its use is however mostly limited to bosonic systems, inhibiting its present applicability to supersymmetric theories. This is also relevant to its application to…
We introduce a uniform representation of general objects that captures the regularities with respect to their structure. It allows a representation of a general class of objects including geometric patterns and images in a sparse, modular,…
The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2^{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the…
Nfer is a rule-based language for abstracting event streams into a hierarchy of intervals with data. Nfer has multiple implementations and has been applied in the analysis of spacecraft telemetry and autonomous vehicle logs. This work…
The incompatibility between gravity and quantum coherence represented by black holes should be solved by a consistent quantum theory that contains gravity as superstring theory. Despite many encouraging results in that sense, I question…
The difficulty of explaining non-local correlations in a fixed causal structure sheds new light on the old debate on whether space and time are to be seen as fundamental. Refraining from assuming space-time as given a priori has a number of…
The domain-independent universal Normalized Information Distance based on Kolmogorov complexity has been (in approximate form) successfully applied to a variety of difficult clustering problems. In this paper we investigate theoretical…
We have proposed novel measures based on the Kolmogorov complexity for use in complex system behavior studies and time series analysis. We have considered background of the Kolmogorov complexity and also we have discussed meaning of the…
Applying a principle of "radical mundanity", this paper examines explanations for the lack of strong evidence for the presence of technology-using extraterrestrial civilizations (ETCs) in the Galaxy - the Fermi paradox. With this principle,…
With the advent of modern astronomy, humans might now have acquired the technological and intellectual requirements to communicate with other intelligent beings beyond the solar system, if they exist. Radio signals have been identified as a…
Why are living systems complex? Why does the biosphere contain living beings with complexity features beyond those of the simplest replicators? What kind of evolutionary pressures result in more complex life forms? These are key questions…
Since it began \cite{CocconiMorrison}, the search for extraterrestrial intelligence (SETI) has focused on interstellar \emph{classical} communication. Recently, Berera \cite{Berera:2020rpl} pointed out that, at certain frequencies, photon…
Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic…
We prove the first meta-complexity characterization of a quantum cryptographic primitive. We show that one-way puzzles exist if and only if there is some quantum samplable distribution of binary strings over which it is hard to approximate…
Let $K$ denote prefix-free Kolmogorov Complexity, and $K^A$ denote it relative to an oracle $A$. We show that for any $n$, $K^{\emptyset^{(n)}}$ is definable purely in terms of the unrelativized notion $K$. It was already known that…
How much information a fermionic state contains? To address this fundamental question, we define the complexity of a particle-conserving many-fermion state as the entropy of its Fock space probability distribution, minimized over all Fock…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…