Related papers: Unpredictable Strings
The theory of sequences, supported by many SMT solvers, can model program data types including bounded arrays and lists. Sequences are parameterized by the element data type and provide operations such as accessing elements, concatenation,…
We review the status of duality symmetries in superstring theories. These discrete symmetries mark the striking differences between theories of pointlike objects and theories of extended objects. They prove to be very helpful in…
A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a…
The perturbative analysis of models of open and closed superstrings presents a number of surprises. For instance, variable numbers of antisymmetric tensors ensure their consistency via generalized Green-Schwarz cancellations and a novel…
This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…
In a recent paper [1], it has been claimed that the outcomes of a quantum coin toss which is idealized as an infinite binary sequence is 1-random. We also defend the correctness of this claim and assert that the outcomes of quantum…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…
There are at present two known string theories in $(2,2)$ dimensions. One of them is the well known $N=2$ string, and the other one is a more recently constructed $N=1$ spacetime supersymmetric string. They are both based on certain…
Currently, string theory represents the only advanced approach to a unification of all interactions, including gravity. In spite of the more than thirty years of its existence it did not make any empirically testable predictions. And it is…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
A statistical model of discrete finite length random processes with negative power law spectral densities is presented. The definition of terms is followed by a description of the spectral density trend. An algorithmic construction of…
At the present time, string theory (and its generalizations) remain relatively abstruse subjects to the particle phenomenologist and experimentalist. Yet, striking developments of the last two years offer hope that a fundamental…
We consider massless string scattering amplitudes in a limit where the number of external particles becomes very large, while the energy of each particle remains small. Using the growth of the volume of the relevant moduli space, and by…
We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…
The probability that a number in many naturally occurring tables of numerical data has first significant digit $d$ is predicted by Benford's Law ${\rm Prob} (d) = \log_{10} (1 + {\displaystyle{1\over d}}), d = 1, 2 >..., 9$. Illustrations…
Black strings, one class of higher dimensional analogues of black holes, were shown to be unstable to long wavelength perturbations by Gregory and Laflamme in 1992, via a linear analysis. We revisit the problem through numerical solution of…
We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the…
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…
We argue that string theory should have a formulation for which stability and causality are evident. Rather than regard strings as fundamental objects, we suggest they should be regarded as composite systems of more fundamental point-like…