Related papers: On the d-complexity of strings

We present a simple physical representation for states of the two-dimensional string theory. In order to incorporate a fundamental cutoff of the order 1/g we use a picture consisting of q-oscillators at the first-quantized level. In this…

This text, written as dissertation within the M.Sc. course in particle theory at the Centre for Particle Theory, University of Durham, during the academic year 1993/94, reviews two articles by D.Gross and by D.Gross and W.Taylor which…

An $(n, 1)$ string is a bound state of a D-string and $n$ fundamental strings. It may be described by a D-string with a world volume electric field turned on. As the electric field approaches its critical value, $n$ becomes large. We…

Is string theory uniquely determined by self-consistency? Causality and unitarity seemingly permit a multitude of putative deformations, at least at the level of two-to-two scattering. Motivated by this question, we initiate a systematic…

We discuss the continuum field theory limit of the physical scenario described in Ref. [1], the universe arising from the interpretation of the most general collection of logical codes in terms of distributions of units of energy along…

We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in…

Regularities in strings are often related to periods and covers, which have extensively been studied, and algorithms for their efficient computation have broad application. In this paper we concentrate on computing cyclic regularities of…

In a previous paper (hep-th/9808141) we showed that the type I string theory contains a stable non-BPS D-particle carrying SO(32) spinor charge. In this paper we formulate the rules for computing the spectrum and interaction of open strings…

We provide a detailed analysis of the problems and prospects of superstring theory c. 1986, anticipating much of the progress of the decades to follow.

This article surveys some of the highlights in the development of string theory through the first superstring revolution in 1984. The emphasis is on topics in which the author was involved, especially the observation that critical string…

The intuition that a long history is required for the emergence of complexity in natural systems is formalized using the notion of depth. The depth of a system is defined in terms of the number of parallel computational steps needed to…

The problem of reconstructing strings from their substring spectra has a long history and in its most simple incarnation asks for determining under which conditions the spectrum uniquely determines the string. We study the problem of coded…

Peptide strings have been developed as a concept for the past fourteen years. They are proposed to basically entail various quantum states engendered by the physical interactions of proteins containing peptide portions that are similar to…

This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply…

We introduce a complexity measure for symbolic sequences. Starting from a segmentation procedure of the sequence, we define its complexity as the entropy of the distribution of lengths of the domains of relatively uniform composition in…

String theory is a quantum theory that reproduces the results of General Relativity at long distances but is completely different at short distances. Mathematically, string theory is based on a very new -- and little understood -- framework…

Although information content is invariant up to an additive constant, the range of possible additive constants applicable to programming languages is so large that in practice it plays a major role in the actual evaluation of K(s), the…

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…

The problem of detecting and measuring the repetitiveness of one-dimensional strings has been extensively studied in data compression and text indexing. Our understanding of these issues has been significantly improved by the introduction…

The strong coupling dynamics of string theories in dimension $d\geq 4$ are studied. It is argued, among other things, that eleven-dimensional supergravity arises as a low energy limit of the ten-dimensional Type IIA superstring, and that a…