Related papers: The Limits of Mathematics---Fourth Version
The scaling laws guiding modern model training were calibrated for a single regime: data-rich, single-epoch pretraining. The dominant such scaling law form, Chinchilla's $L = E + A/N^\alpha + B/D^\beta$, has three structural limitations…
An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\text{MOD}_m$ gates where $m$…
Inspired by prior work by Tian and by Cao and Xu, this paper presents an efficient computer-aided framework to characterize the fundamental limits of coded caching systems under the constraint of linear coding. The proposed framework…
We show that for 1<n<m, the class Nr_nCA_m known to be non-elementary is pseudo elementary. When n and m are finite we use a two sorted theory, when n is finite and m infinite we use a three sorted one, and finally when both are infinite we…
We consider the problem of representing, in a compressed format, a bit-vector $S$ of $m$ bits with $n$ 1s, supporting the following operations, where $b \in \{0, 1 \}$: $rank_b(S,i)$ returns the number of occurrences of bit $b$ in the…
Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given…
Emil Post's tag system problem posed the question of whether or not a tag system $\{N=3, P(0) = 00, P(1) = 1101\}$ has a configuration, simulation of which will never halt or end up in a loop. Over the subsequent decades, there were several…
Asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity of a class of dynamic programming algorithms including matrix chain multiplication, optimal polygon triangulation, and the construction of optimal binary…
Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on \textit{at most} a bits? Let 0\leq a\leq n-1. We show that any deterministic protocol, as well as any error-free quantum protocol (C*…
The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…
We revisit the hardness of approximating the diameter of a network. In the CONGEST model of distributed computing, $ \tilde \Omega (n) $ rounds are necessary to compute the diameter [Frischknecht et al. SODA'12], where $ \tilde \Omega…
In quantum/wave systems with chaotic classical analogs, wavefunctions evolve in highly complex, yet deterministic ways. A slight perturbation of the system, though, will cause the evolution to diverge from its original behavior increasingly…
In this letter, we introduce the computational-limited (comp-limited) signals, a communication capacity regime in which the signal time computational complexity overhead is the key constraint -- rather than power or bandwidth -- to the…
In this paper, we investigate the complexity of the central path of semidefinite optimization through the lens of real algebraic geometry. To that end, we propose an algorithm to compute real univariate representations describing the…
The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elements that sum up to a given target $t$. It is an outstanding open question whether the $O^*(2^{n/2})$-time algorithm for Subset Sum by…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
In this paper, we seek a natural problem and a natural distribution of instances such that any $O(n^{c-\epsilon})$-time algorithm fails to solve most instances drawn from the distribution, while the problem admits an $n^{c+o(1)}$-time…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to…
We develop an abstract way of defining linear-optics networks designed to perform quantum information tasks such as quantum gates. We will be mainly concerned with the nonlinear sign shift gate, but it will become obvious that all other…