Related papers: Some properties of antistochastic strings

It is known that the set of all nonnegative integers may be equipped with a total order that is chaotic in the sense that there is no monotone three-term arithmetic progressions. Such chaotic order must be so complicated that the resulting…

A $c$-short program for a string $x$ is a description of $x$ of length at most $C(x) + c$, where $C(x)$ is the Kolmogorov complexity of $x$. We show that there exists a randomized algorithm that constructs a list of $n$ elements that…

Which statistical features distinguish a meaningful text (possibly written in an unknown system) from a meaningless set of symbols? Here we answer this question by comparing features of the first half of a text to its second half. This…

The notion of Kolmogorov complexity (=the minimal length of a program that generates some object) is often useful as a kind of language that allows us to reformulate some notions and therefore provide new intuition. In this survey we…

If no optimal propositional proof system exists, we (and independently Pudl\'ak) prove that ruling out length $t$ proofs of any unprovable sentence is hard. This mapping from unprovable to hard-to-prove sentences powerfully translates facts…

We present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connected. It proves to be enough to construct strings with some…

The mathematical idea of resurgence allows one to obtain nonperturbative information from the large-order behavior of perturbative expansions. This idea can be very fruitful in physics applications, in particular if one does not have access…

We show that extremely simple systems of a not too large number of particles can be simultane- ously thermally stable and complex. To such an end, we extend the statistical complexity's notion to simple configurations of non-interacting…

A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…

We identify new, rather serious, physical and axiomatic inconsistencies of the current formulation of string theories due to the lack of invariant units necessary for measurements, lack of preservation in time of Hermiticity-observability,…

Instead of static entropy we assert that the Kolmogorov complexity of a static structure such as a solid is the proper measure of disorder (or chaoticity). A static structure in a surrounding perfectly-random universe acts as an interfering…

Homogeneous gravitational wave backgrounds arise as infinite momentum limits of many geometries with a well-understood holographic description. General global aspects of these geometries are discussed. Using exact CFT techniques, strings in…

The Hamiltonian BRST quantization of the null spinning string for different number of supersymmetries is given. A null spinning string with manifest space-time conformal invariance is constructed. Its Brst quantization gives negative…

We construct a string field theory for c=1 noncritical strings using the loop variables as the string field. We show how one can express the nonrelativistic free fermions which describes the theory, in terms of these string fields.

An end-to-end solution for handwritten numeral string recognition is proposed, in which the numeral string is considered as composed of objects automatically detected and recognized by a YoLo-based model. The main contribution of this paper…

We find a new sector of string theory in AdS_5xS^5 describing non-relativistic superstrings in that geometry. The worldsheet theory of non-relativistic strings in AdS_5xS^5 is derived and shown to reduce to a supersymmetric free field…

We show that bounded families of global classical relativistic strings that can be written as graphs are relatively compact in C0 topology, but their accumulation points include many non relativistic strings. We also provide an alternative…

We describe a general formalism based on the partial-wave decomposition to compute the iterative $s$-channel discontinuity of four-point amplitudes at any loop order. As an application, we focus on the low-energy expansions of type I and II…

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…

In hep-th/0310120, Goheer, Kleban and Susskind argued that the holographic principle is inconsistent with the existence of stable, Lorentz invariant, 1+1 dimensional compactifications. We note some difficulties with their analysis and…