Related papers: Unpredictable Strings
Many data management applications must deal with data which is uncertain, incomplete, or noisy. However, on existing uncertain data representations, we cannot tractably perform the important query evaluation tasks of determining query…
We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.
The holomorphy of the superpotential along with symmetries gives very strong constraints on any stringy non-perturbative effects. This observation suggests an approach to string phenomenology. (Presented at ``Strings 95'', March 1995.
For each of (i) arbitrary stochastic reset, (ii) deterministic reset with arbitrary period, (iii) reset at arbitrary constant rate, and then in the sense of either (a) first-order stochastic dominance or (b) expectation (i.e. for each of…
We define string geometry: spaces of superstrings including the interactions, their topologies, charts, and metrics. Trajectories in asymptotic processes on a space of strings reproduce the right moduli space of the super Riemann surfaces…
We realize bosonic string theory with ensembles of infinite width neural networks. The string tension is tuned by the variance of the output weights. The construction provides a new computation of the foundational Virasoro-Shapiro and…
In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we…
String theory builds on the great legacy of Yukawa and Tomonaga: New degrees of freedom and control of the UV are two important themes. This talk will give an overview of some of the progress and some of the unsolved problems that…
We explore in depth the number theoretic and statistical properties of certain sets of numbers arising from their Cantor series expansions. As a direct consequence of our main theorem we deduce numerous new results as well as strengthen…
The past year has seen enormous progress in string theory. It has become clear that all of the different string theories are different limits of a single theory. Moreover, in certain limits, one obtains a new, eleven-dimensional structure…
We study the classification problems over string data for hypotheses specified by formulas of monadic second-order logic MSO. The goal is to design learning algorithms that run in time polynomial in the size of the training set,…
This is a broad-brush review of how string theory addresses several important questions of gravitational physics. The problem of non-renormalizability is first reviewed, followed by introduction of string theory as an ultraviolet-finite…
The predictability of a sequence is defined as the asymptotic performance of the best performing predictor in a given class. The value of the predictability of a sequence will in general depend on the choice of this predictor class. The…
The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…
Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth…
Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…
In this paper, we consider U-statistics whose data is a strictly stationary sequence which can be expressed as a functional of an i.i.d. one. We establish a strong law of large numbers, a bounded law of the iterated logarithms and a central…
We carry on the study of the synthesis problem on data words for fragments of first order logic, and delineate precisely the border between decidability and undecidability.
We show the first unconditional pseudo-determinism result for all of search-BPP. Specifically, we show that every BPP search problem can be computed pseudo-deterministically on average for infinitely many input lengths. In other words, for…
This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of…