Related papers: On the Holographic Geometry of Deterministic Compu…
When an optimal control problem is solved for all possible initial conditions at once, the initial-state space splits into critical regions, each carrying a closed-form control law that can be evaluated online without solving any…
We study a holographic theory of general spacetimes that does not rely on the existence of asymptotic regions. This theory is to be formulated in a holographic space. When a semiclassical description is applicable, the holographic space is…
We propose an algorithm which builds a concrete dual for large-radius 3d de Sitter with a timelike York boundary for both gravity and bulk effective fields. This generalizes the solvable $T\bar T+\Lambda_2$ deformation, whose finite real…
The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly ``program,'' a set of tiles that fit together to create a shape. It seems plausible that the size of the smallest…
We discuss the following family of problems, parameterized by integers $C\geq 2$ and $D\geq 1$: Does a given one-tape non-deterministic $q$-state Turing machine make at most $Cn+D$ steps on all computations on all inputs of length $n$, for…
We consider the problem of designing fundamental graph algorithms on the model of Massive Parallel Computation (MPC). The input to the problem is an undirected graph $G$ with $n$ vertices and $m$ edges, and with $D$ being the maximum…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
We study the question of what is computable by Turing machines equipped with time travel into the past; i.e., with Deutschian closed timelike curves (CTCs) having no bound on their width or length. An alternative viewpoint is that we study…
There is ample evidence that the bulk dual of a $T\overline{T}$ deformed holographic CFT is a gravitational system with a finite area cutoff boundary. For states dual to black holes, the finite cutoff surface cannot be moved beyond the…
This paper presents empirical results from a production-grade C++ implementation of a deterministic semantic state substrate operating under bounded local state evolution. The system was realized as a CPU-resident persistent semantic graph…
Topological data analysis (TDA), while abstract, allows a characterization of time-series data obtained from nonlinear and complex dynamical systems. Though it is surprising that such an abstract measure of structure - counting pieces and…
Topological holography is a holographic principle that describes the generalized global symmetry of a local quantum system in terms of a topological order in one higher dimension. This framework separates the topological data from the local…
We propose a measure of holographic information based on a causal wedge construction. The motivation behind this comes from an attempt to understand how boundary field theories can holographically reconstruct spacetime. We argue that given…
Despite the evident necessity of topological protection for realizing scalable quantum computers, the conceptual underpinnings of topological quantum logic gates had arguably remained shaky, both regarding their physical realization as well…
Hole-ography is a prescription relating the areas of surfaces in an AdS bulk to the differential entropy of a family of intervals in the dual CFT. In (2+1) bulk dimensions, or in higher dimensions when the bulk features a sufficient degree…
Task-based runtime systems provide flexible load balancing and portability for parallel scientific applications, but their strong scaling is highly sensitive to task granularity. As parallelism increases, scheduling overhead may transition…
In holographic duality, if a boundary state has a geometric description that realizes the Ryu-Takayanagi proposal then its entanglement entropies must obey certain inequalities that together define the so-called holographic entropy cone. A…
We introduce a compressed suffix array representation that, on a text $T$ of length $n$ over an alphabet of size $\sigma$, can be built in $O(n)$ deterministic time, within $O(n\log\sigma)$ bits of working space, and counts the number of…
A classic result of Paul, Pippenger, Szemer\'edi and Trotter states that DTIME(n) is strictly contained in NTIME(n). The natural question then arises: could DTIME(t(n)) be contained in NTIME(n) for some superlinear time-constructible…
We study deterministic top-k retrieval under Longest Common Prefix (LCP) similarity for N sequences of length L. We prove a tight Omega(N) space lower bound (cell-probe model) and present a trie-based index using O(N*L) space with O(L+k)…