Calendar
Posts organized
by date.00:00
The Internals Of A Modern Garbage Collector: Generational, Concurrent, And Compacting (like C4)
00:00A comprehensive technical exploration of the internals of a modern garbage collector: generational, concurrent, and compacting (like c4), covering key concepts, practical implementations, and real-world applications.
The PCP Theorem: Why Some Problems Are Hard Even to Approximate
Unpack one of theoretical computer science's crown jewels: the PCP theorem, which shows that for many NP-hard problems, even finding an approximate solution is intractable — and how probabilistically checkable proofs revolutionized our understanding of hardness.