It's impossible to choose a number at random

Video thumbnail: It's impossible to choose a number at random
Aug 24, 20261m 41s video lengthVeritasium

The Signal

Mathematical selection in computers relies on deterministic algorithms rather than true randomness, but attempts to apply simple ordering rules to the real numbers fail because they lack a smallest element. This excerpt frames the real numbers as inherently resistant to naive sequencing, establishing a historical mission to definitively order them that began in 1870.

The Case

Deterministic Selection

  • Mathematical selection is framed as rule-governed because formulas consistently produce the same result, precluding true randomness.0:00
  • Computers do not possess true random number generators; instead, they execute algorithms seeded by the current local time to create the appearance of randomness.

The Ordering Problem

  • Selection rules like "pick the smallest" function easily for whole positive integers—starting at 1—or prime numbers, which begin at 2.
  • The real numbers defy these rules because they are infinitely dense and unbounded; there is no smallest real number and no clear "next" number after 1, as an infinite set of values always exists between any two candidates.0:36

Historical Stakes

  • The narrator claims a single, unnamed man began an ambitious project in 1870 to impose a definitive order on the real numbers.1:27
  • The excerpt concludes with an unfinished account of this mission, suggesting the endeavor carried high personal stakes for the individual involved.

The 1 Minute Signal Take

The excerpt correctly identifies the tension between discrete sets with clear minimums and the continuous, dense nature of real numbers. It sets up a compelling narrative about the history of mathematics, though it remains incomplete regarding the identity of the 1870 figure and the ultimate feasibility of his goal.

Pro Analysis

Why it Matters

This content highlights the friction between intuitive human choices and the rigid constraints of mathematical systems. It exposes why 'randomness' in our digital infrastructure is a curated approximation, not a fundamental property, which has implications for everything from cryptography to simulation theory.

Strategic Implications

For developers and data scientists, the content serves as a reminder that randomness is a stack-dependent outcome. Relying on pseudo-random generators without understanding their deterministic seeding can lead to predictable patterns in sensitive systems. For mathematicians, the discussion touches on the necessity of the Axiom of Choice and the limitations of ordinality in continuous sets.

Evidence & Hype Audit

This is a pedagogical setup rather than a technical deep dive. It is low on rigor—using terms like 'smallest' instead of 'well-ordered'—but high in conceptual intrigue. The '1870' hook acts as narrative scaffolding to sustain interest in what would otherwise be a dry lecture on set density.

Counterarguments

Critics of the narrative might argue that while the real numbers are not well-ordered in their standard form, they can be placed in a bijection with other sets or treated through measure theory. The 'impossibility' mentioned is relative to naive sorting, not to the entirety of mathematical inquiry.

Who Should Care

  • Software Engineers: To understand the entropy limits of pseudo-random number generators.
  • Math Enthusiasts: For the historical framing of set-ordering problems.
  • Philosophers of Science: For the distinction between deterministic computation and objective chance.

What to Do Next

  • Investigate the difference between pseudo-random and cryptographically secure random number generators.
  • Review the formal definition of the Well-Ordering Theorem and why it fails for the real numbers.
  • Research Georg Cantor’s work in the 1870s regarding set theory and the cardinality of infinite sets.
  • Evaluate how standard programming languages handle floating-point precision versus theoretical real numbers.

Share this

Tags

Written by: 1 Minute Signal Editorial Team