3 papers
cs.CC2026
via Tree Height Compression
Logan Nye
We prove a square-root space simulation for deterministic multitape Turing machines, showing \emph{measured in tape cells ov…
cs.CR2025
Zero-Knowledge Proofs in Sublinear Space
Logan Nye
Zero-knowledge proofs allow verification of computations without revealing private information. However, existing systems require memory proportional to the computation size, which…
cs.LO2025
Categorical Construction of Logically Verifiable Neural Architectures
Logan Nye
Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by…