相关论文: Some properties of antistochastic strings
Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \emph{coding theorem method} the complexity of strings of length…
The string equivalent of a massless particle ($m=0$) is the tensionless string ($T=0$). The study of such strings is of interest when trying to understand the high energy limit of ordinary strings. I discuss the classical $T\to 0$ limit of…
This paper studies reconstruction of strings based upon their substrings spectrum. Under this paradigm, it is assumed that all substrings of some fixed length are received and the goal is to reconstruct the string. While many existing works…
Recently, a topological proof of the spin-statistics Theorem has been proposed for a system of point particles which does not require relativity or field theory, but assumes the existence of antiparticles. We extend this proof to a system…
We prove that the extremum stack of a discrete sequence is a minimal sufficient statistic for the class of all computable, causal, rate-independent functionals, in the sense of Kolmogorov complexity. Specifically, we establish K(Pi_n) -…
String diagrams are an increasingly popular algebraic language for the analysis of graphical models of computations across different research fields. Whereas string diagrams have been thoroughly studied as semantic structures, much less…
Symmetry of information states that $C(x) + C(y|x) = C(x,y) + O(\log C(x))$. We show that a similar relation for online Kolmogorov complexity does not hold. Let the even (online Kolmogorov) complexity of an n-bitstring $x_1x_2... x_n$ be…
We introduce so-called chaotic strings (coupled 1-dimensional noise strings underlying the Parisi-Wu approach of stochastic quantization on a small scale) as a possible amendment of ordinary string theories. These strings are strongly…
The holographic ratio in Pre-big bang string cosmology is obtained in the presence string sources. An iterative procedure is adopted to solve the equations of motion and derive the ratio in four dimensional world. First the zeroth order…
Kolmogorov (1965) defined the complexity of a string $x$ as the minimal length of a program generating $x$. Obviously this definition depends on the choice of the programming language. Kolmogorov noted that there exist \emph{optimal}…
We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is…
Given a collection of strings, each with an associated probability of occurrence, the guesswork of each of them is their position in a list ordered from most likely to least likely, breaking ties arbitrarily. Guesswork is central to several…
A 1976 theorem of Chaitin can be used to show that arbitrarily dense sets of lengths n have a paucity of trivial strings (only a bounded number of strings of length n having trivially low plain Kolmogorov complexities). We use the…
We introduce the notion of holographic non-computer as a system which exhibits parametrically large delays in the growth of complexity, as calculated within the Complexity-Action proposal. Some known examples of this behavior include…
String cosmology is revisited from cosmological viewpoint of holographic principle put forward by `t Hooft, and by Fischler and Susskind. It is shown that the holography requires existence of a `graceful exit' mechanism, which renders the…
We first present a useful characterization of additive (stabilizer) quantum error-correcting codes. Then we present several examples of We first present a useful characterization of additive (stabilizer) quantum error--correcting codes.…
Recent advances in non-critical string theory allow a unique continuation of critical Polyakov string amplitudes to off-shell momenta, while preserving conformal invariance. These continuations possess unusual, apparently stringy,…
We present IsalGraph, a method for representing the structure of any finite, simple graph as a compact string over a nine-character instruction alphabet. The encoding is executed by a small virtual machine comprising a sparse graph, a…
The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…
We present explicit examples of semi-realistic heterotic models with spontaneously broken supersymmetry, which dynamically lead to breaking scales much smaller than $M_{\rm Planck}$ and exponentially small positive values for the…