相关论文: Some properties of antistochastic strings
We prove a Kolmogorov complexity variant of the birthday paradox. Sufficiently sized random subsets of strings are guaranteed to have two members x and y with low K(x/y). To prove this, we first show that the minimum conditional Kolmogorov…
For each partition of a data set into a given number of parts there is a partition such that every part is as much as possible a good model (an "algorithmic sufficient statistic") for the data in that part. Since this can be done for every…
Assume that for some $\alpha<1$ and for all nutural $n$ a set $F_n$ of at most $2^{\alpha n}$ "forbidden" binary strings of length $n$ is fixed. Then there exists an infinite binary sequence $\omega$ that does not have (long) forbidden…
Kolmogorov suggested to measure quality of a statistical hypothesis $P$ for a data $x$ by two parameters: Kolmogorov complexity $C(P)$ of the hypothesis and the probability $P(x)$ of $x$ with respect to $P$. P. G\'acs, J. Tromp, P.M.B.…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
Human language has a distinct systematic structure, where utterances break into individually meaningful words which are combined to form phrases. We show that natural-language-like systematicity arises in codes that are constrained by a…
Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular compression schemes. In this paper, we present a novel…
Algorithmic statistics studies explanations of observed data that are good in the algorithmic sense: an explanation should be simple i.e. should have small Kolmogorov complexity and capture all the algorithmically discoverable regularities…
Many machine learning libraries require that string features be converted to a numerical representation for the models to work as intended. Categorical string features can represent a wide variety of data (e.g., zip codes, names, marital…
Particle theorists typically use expectation values to study the quantum back-reaction on inflation, whereas many cosmologists stress the stochastic nature of the process. While expectation values certainly give misleading results for some…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
Utilizing the hyperspace of noise-based logic, we show two string verification methods with low communication complexity. One of them is based on continuum noise-based logic. The other one utilizes noise-based logic with random telegraph…
We show that the set $SCL^{rp}$ of stable commutator lengths on recursively presented groups equals the set of non-negative right-computable numbers. Hence all non-negative algebraic or computable numbers are in $SCL^{rp}$ and $SCL^{rp}$ is…
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strings that are random and pairwise independent. If the two…
We present a class of exact cosmological solutions of the low energy string effective action in the presence of a homogeneous magnetic fields. We discuss the physical properties of the obtained (fully anisotropic) cosmologies paying…
We define string geometry: spaces of superstrings including the interactions, their topologies, charts, and metrics. Trajectories in asymptotic processes on a space of strings reproduce the right moduli space of the super Riemann surfaces…
We present a fully automatic method for music classification, based only on compression of strings that represent the music pieces. The method uses no background knowledge about music whatsoever: it is completely general and can, without…
The word "complexity" is most often used as a meta--linguistic expression referring to certain intuitive characteristics of a natural system and/or its scientific description. These characteristics may include: sheer amount of data that…
In any string theory there is a hidden, twisted superconformal symmetry algebra, part of which is made up by the BRST current and the anti-ghost. We investigate how this algebra can be systematically constructed for strings with $N\!-\!2$…
We present a general algorithm which permits to construct solutions in string cosmology for heterotic and type-IIB superstrings in four dimensions. Using a chain of transformations applied in sequence: conformal, T-duality and SL(2,R)…