Related papers: Random noise increases Kolmogorov complexity and H…
We investigate the effect of $R^2$ corrections on holographic complexity growth within the framework of the Complexity=Action(CA) conjecture. By introducing a probe string into Gauss-Bonnet(GB) $AdS$ black brane background, we analyze the…
We provide tight upper and lower bounds on the expected minimum Kolmogorov complexity of binary classifiers that are consistent with labeled samples. The expected size is not more than complexity of the target concept plus the conditional…
We introduce a new complexity measure for finite strings using probabilistic finite-state automata (PFAs), in the same spirit as existing notions employing DFAs and NFAs, and explore its properties. The PFA complexity $A_P(x)$ is the least…
Benjamini, Kalai and Schramm (2001) showed that weighted majority functions of $n$ independent unbiased bits are uniformly stable under noise: when each bit is flipped with probability $\epsilon$, the probability $p_\epsilon$ that the…
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…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
Astrophysical and cosmological signals such as the cosmic microwave background radiation, as observed, typically contain contributions of different components, and their statistical properties can be used to distinguish one from the other.…
Imagine a sequence in which the first letter comes from a binary alphabet, the second letter can be chosen on an alphabet with 10 elements, the third letter can be chosen on an alphabet with 3 elements and so on. When such a sequence can be…
We investigate a population of binary mistake sequences that result from learning with parametric models of different order. We obtain estimates of their error, algorithmic complexity and divergence from a purely random Bernoulli sequence.…
Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvantages of Kolmogorov complexity, also known as algorithmic information…
We extend and develop our previous work on the evolution of a network of cosmic strings. The new treatment is based on an analysis of the probability distribution of the end-to-end distance of a randomly chosen segment of left-moving string…
In contrast to entropy, which increases monotonically, the "complexity" or "interestingness" of closed systems seems intuitively to increase at first and then decrease as equilibrium is approached. For example, our universe lacked complex…
We develop the theory of cryptographic nondeterministic-secure pseudorandomness beyond the point reached by Rudich's original work (Rudich 1997), and apply it to draw new consequences in average-case complexity and proof complexity.…
Let $G$ be an $n$-vertex graph, where $\delta(G) \geq \delta n$ for some $\delta := \delta(n)$. A result of Bohman, Frieze and Martin from 2003 asserts that if $\alpha(G) = O \left(\delta^2 n \right)$, then perturbing $G$ via the addition…
The small mass limit of the Langevin equation perturbed by $\alpha$-stable L\'{e}vy noise is considered by rewriting it in the form of slow-fast system, and spliting the fast component into three parts, where $\alpha\in(1,2)$. By exploring…
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing…
We prove that if $A$ is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density…
In this paper we consider the palindromes that can be formed by taking unordered sets of $n$ elements from an alphabet of $b$ letters. In particular, we seek to find the probability that given a random member of this space we are able to…
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of type "Is x in A?" can be answered very quickly. H.Buhrman,…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…