# The Ubiquity of Space-Time Simulation in Modern Computing: From Theory to Practice
This repository contains the academic paper exploring how Ryan Williams' 2025 theoretical result, TIME[t] ⊆ SPACE[√(t log t)], manifests in real-world computing systems.
## Paper
**Title**: The Ubiquity of Space-Time Simulation in Modern Computing: From Theory to Practice
**Author**: David H. Friedel Jr., Founder, MarketAlly LLC (USA) & MarketAlly Pte. Ltd. (Singapore)
**Status**: Submitted to arXiv (needing endorsement)
## Abstract
Ryan Williams' 2025 result demonstrates that any time-bounded algorithm can be simulated using only O(√(t log t)) space, establishing a fundamental limit on the space-time relationship in computation. This paper bridges the gap between this theoretical breakthrough and practical computing systems. Through controlled experiments and analysis of production systems, we show that space-time tradeoffs following the √n pattern are ubiquitous across databases, machine learning frameworks, and distributed systems. However, we find that practical constant factors range from 100× to 10,000×, primarily due to memory hierarchies and I/O overhead.
## Related Repositories
- **[Experiments & Code](https://github.com/sqrtspace/sqrtspace-experiments)**: Full implementation, experiments, and interactive dashboard
- **[Interactive Dashboard](https://github.com/sqrtspace/sqrtspace-experiments/tree/main/dashboard)**: Streamlit app for exploring space-time tradeoffs
This paper is licensed under CC BY 4.0. You may share and adapt the material with proper attribution.
## Acknowledgments
This work was carried out independently as part of early-stage R&D at MarketAlly LLC and MarketAlly Pte. Ltd. We acknowledge the use of large language models for drafting assistance.