Thoughts, stories and ideas.
"The theory of probabilities is at bottom nothing but common sense reduced to calculus." — Pierre-Simon Laplace, Théorie analytique des probabilités , 1812 1. Introduction In a previous essay , we explored how BM25 scores can be transformed into calibrated probability estimates through a sigmoid-
Abstract Just-in-time compilation offers significant performance improvements for database query execution by eliminating interpreter overhead. However, traditional JIT frameworks such as LLVM introduce compilation latencies measured in milliseconds, which fail to amortize for typical OLTP workloads. This article presents a practical implementation of stencil-based JIT compilation for
Introduction "There is nothing more powerful than an idea whose time has come." — Victor Hugo, Histoire d'un Crime , 1852 Through four essays, we have traced the paradox of transcendence from Nietzsche's assumption of divine authority in proclaiming God's death, through the
Abstract This report presents a comprehensive analysis of two fundamental compiler optimization techniques: Loop Invariant Code Motion (LICM) and Static Single Assignment (SSA) Form. We explore the theoretical foundations, implementation algorithms, and practical applications of these techniques in modern optimizing compilers. The report demonstrates how SSA form provides an elegant
Introduction "What can be shown, cannot be said." — Ludwig Wittgenstein, Tractatus Logico-Philosophicus , 4.1212 Through the first three essays of this series, we have traced a philosophical journey from Nietzsche's paradoxical assumption of divine authority in proclaiming God's death, through the transformation
Based on the paper: Geometric Adam: Ray Tracing-Inspired Adaptive Optimization by Jaepil Jeong, Cognica Inc. Introduction In the pursuit of stable neural network optimization, we often look to mathematics for inspiration. But what if the answer lies in physics? This research essay explores Geometric Adam, a novel optimizer that
Introduction "God is dead. God remains dead. And we have killed him. How shall we comfort ourselves, the murderers of all murderers?" — Friedrich Nietzsche, The Gay Science , §125 In the first two essays of this series, we explored how Nietzsche's proclamation of God'
Introduction "I am afraid we are not getting rid of God because we still have faith in grammar." — Friedrich Nietzsche, Beyond Good and Evil , §54 In "The Immortal Divine: Nietzsche's Paradox and the Structural Necessity of Transcendence," we explored how Nietzsche'
Introduction "God is dead. God remains dead. And we have killed him. How shall we comfort ourselves, the murderers of all murderers?" — Friedrich Nietzsche, The Gay Science , §125 Friedrich Nietzsche's proclamation in The Gay Science represents one of the most provocative philosophical assertions of
1. Introduction Modern cloud infrastructure presents a fascinating paradox: as we advance toward more sophisticated hardware architectures, virtualization increasingly obscures these same architectures from the software running within virtual machines. This phenomenon is particularly evident in Non-Uniform Memory Access (NUMA) systems, where memory access times depend on the memory
Introduction The ability of language to refer to itself creates a fundamental paradox that reverberates throughout philosophy, mathematics, logic, and our understanding of consciousness. This self-referential capacity—the ability to turn language upon itself—simultaneously enables our most profound insights and generates our most perplexing paradoxes. From
1. Introduction "A picture held us captive. And we could not get outside it, for it lay in our language and language seemed to repeat it to us inexorably." — Ludwig Wittgenstein, Philosophical Investigations , §115 For three decades, the software industry has been periodically swept by waves
1. Introduction For decades, computer science education and practice have followed certain established patterns when it comes to selecting data structures. We learn that linked lists offer $O(1)$ insertion and deletion, that skip lists provide $O(\log n)$ search with simpler implementation than balanced trees, and that hash tables
1. Introduction The evolution of computer architectures represents one of the most fascinating chapters in computing history. While modern processors have embraced radical design changes to achieve unprecedented performance, there remains significant educational and research value in understanding the architectural foundations upon which they were built. My childhood memories of
Abstract Range queries like value:[0 TO 1000000] present significant performance challenges in search engines. This paper provides a comprehensive mathematical framework for understanding and optimizing range query performance. We present rigorous models for tiered indexing, range decomposition, information-theoretic tier selection, block-skipping probability, and performance optimization in…