How Machines Generate Random Numbers with Time

Channel:
Canada Art of the Problem
Subscribers:
177,000
Published on ● Video Link: https://www.youtube.com/watch?v=Ac4Z1VMsE3E


Duration: 1:29
53,348 views
670

Pseudorandom number generators are explained using John Von Neumann's middle squares method. Machines can't roll dice so they do a trick to generate randomness - they grow randomness. The middle squares method is explained from a computer science perspective using clocks as seeds. This is a clip from Art of the Problem episode #1. This clip features original music from Hannah Addario-Berry



Other Videos By Art of the Problem


2012-05-04Gambling with Secrets: Part 6/8 (Perfect Secrecy & Pseudorandomness)
2012-04-24The Enigma Machine (how it worked & why it was cracked)
2012-04-17Claude Shannon's Perfect Secrecy
2012-03-12Gambling with Secrets: Part 5/8 (Encryption Machines)
2012-02-24Public Key Cryptography: Diffie-Hellman Key Exchange (short version)
2012-02-14Gambling with Secrets: Part 4/8 (Private Key Cryptography)
2012-01-13Gambling with Secrets: Part 3/8 (Probability Theory & Randomness)
2011-12-12Gambling with Secrets: Part 2/8 (Prime Factorization)
2011-12-12Gambling with Secrets: Part 1/8 (What is Cryptography?)
2011-10-23Art of the Problem.
2011-10-23How Machines Generate Random Numbers with Time
2011-10-17Caesar Cipher - Ancient Cryptography
2011-10-07Teaser Trailer: Gambling with Secrets (pilot episode)
2011-10-05Random Sequences: Human vs Coin
2011-09-28Prime Numbers as Building Blocks - Euclid's greatest discovery
2011-08-25Calculate Probablity Visually. The Mathematics of Gambling
2011-06-11Ulam Spiral Visualization - The Pattern of Prime Numbers


Tags:
random number generator
pseudorandom
how to generate
middle squares
pick random numbers
john von neumann
mechanical randomness
random seeds
random algorithms
art of the problem
probability
computer science
Mechanical Engineering
math
hannah addario berry
Electronics
history of computers