Related papers: On the d-complexity of strings
Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…
Infinite sequences are of tremendous theoretical and practical importance, and in the Information Age sequences of 0s and 1s are of particular interest. Over the past century, the field of symbolic dynamics has developed to study sequences…
We review the current status of the singularity problem in string theory for non-experts. After the problem is discussed from the point of view of supergravity, we discuss classic examples and recent examples of singularity resolution in…
Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. We seek to…
Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as…
In this paper the $c=1$ string theory is studied from the point of view of topological field theories. Calculations are done for arbitrary genus. A change in the prescription is proposed, which reproduces the results of the $1/x^2$ deformed…
The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n\le N$ the number of all distinct subwords of $w$ having the length $n$. We define the \emph{maximal complexity} C(w) as the maximum of the…
Kolmogorov complexity is a measure of the information contained in a binary string. We investigate here the notion of quantum Kolmogorov complexity, a measure of the information required to describe a quantum state. We show that for any…
Let $S_{T}(k)$ denote the set of distinct substrings of length $k$ in a string $T$, then the $k$-th substring complexity is defined by its cardinality $|S_{T}(k)|$. Recently, $\delta = \max \{ |S_{T}(k)| / k : k \ge 1 \}$ is shown to be a…
This review is devoted to strings and branes. Firstly, perturbative string theory is introduced. The appearance of various types of branes is discussed. These include orbifold fixed planes, D-branes and orientifold planes. The connection to…
This paper examines the randomness of d-sequences, which are decimal sequences to an arbitrary base. Our motivation is to check their suitability for application to cryptography, spread-spectrum systems and use as pseudorandom sequence.
It is argued that string theory may pose new conceptual issues for the history and philosophy of science.
The role of integrable systems in string theory is discussed. We remind old examples of the correspondence between stringy partition functions or effective actions and integrable equations, based on effective application of the matrix model…
I suggest the possibility of a new string in ten dimensions. Evidence for this string is presented both from orientifold physics and from K-theory, along with a mystery concerning the M-theory description. Motivated by this possibility,…
The term {\em complexity} is used informally both as a quality and as a quantity. As a quality, complexity has something to do with our ability to understand a system or object -- we understand simple systems, but not complex ones. On…
V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a…
Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…
Using a classical action associated to a point-particle in (1+1)-dimensions the classical string theory is derived. In connection with this result two aspects are clarified: First, the point particle in (1+1)-dimensions is not an ordinary…
In this thesis time-dependent configurations are studied in the formalism of first-quantized string. These configurations are exact: solutions of the corresponding two-dimensional conformal field theory can be found. We can compute…