Get your free personalized podcast brief

We scan new podcasts and send you the top 5 insights daily.

In algorithm design, randomness isn't free. High-quality random bits (from quantum sources) are expensive, while cheaper sources (thermal noise) have lower quality. This reframes randomness as a resource to be managed and minimized, just like time or space complexity.

Related Insights

The brain's hardware limitations, like slow and stochastic neurons, may actually be advantages. These properties seem perfectly suited for probabilistic inference algorithms that rely on sampling—a task that requires explicit, computationally-intensive random number generation in digital systems. Hardware and algorithm are likely co-designed.

Traditional software relies on predictable, deterministic functions. AI agents introduce a new paradigm of "stochastic subroutines," where correctness and logic are abdicated. This means developers must design systems that can achieve reliable outcomes despite the non-deterministic paths the AI might take to get there.

The "hardness versus randomness" paradigm reveals a deep connection: if a problem is computationally hard (like P≠NP is believed to be), its unpredictability can be used to construct pseudorandom generators. These generators turn a few true random bits into long sequences that can derandomize any efficient probabilistic algorithm.

Unlike deterministic search algorithms, LLMs have a "temperature" feature that introduces randomness. Instead of picking the most likely next word, it randomly chooses from a pool of likely options. This makes AI-generated search results inherently unpredictable and variable over time.

The theory of randomness extraction provides methods to take a long string of bits from a weak source (e.g., weather data) and distill it into a shorter string of nearly perfect, uniformly random bits. This is crucial for using real-world physical phenomena as a viable source for cryptographic applications.

Future literacy requires understanding concepts beyond deterministic algorithms. As AI tools become more prevalent, users will need to grasp probabilistic and stochastic systems to effectively build with and manage them, recognizing that outputs are not always perfectly reproducible.

Public announcements about quantum computing progress often cite high numbers of 'physical qubits,' a misleading metric due to high error rates. The crucial, error-corrected 'logical qubits' are what matter for breaking encryption, and their number is orders of magnitude lower, providing a more realistic view of the technology's current state.

Instead of competing on speed and energy alone, Normal Computing is designing ASICs that introduce noise as a third optimization vector. These chips are ideal for probabilistic workloads like diffusion models, which are inherently noisy and approximate, mapping the software's physics to the hardware's.

A coin toss is random to a human but predictable to a supercomputer with high-speed cameras. This shows randomness is not an inherent property of an event, but a reflection of an observer's inability to compute the outcome. The less powerful the observer, the more random an event appears.

The primary obstacle to creating a fully autonomous AI software engineer isn't just model intelligence but "controlling entropy." This refers to the challenge of preventing the compounding accumulation of small, 1% errors that eventually derail a complex, multi-step task and get the agent irretrievably off track.

Randomness Is a Computational Resource with Varying Costs and Quality, Not a Physical Property | RiffOn