A Random Walk
summary
Slides are shuffled by a small Ruby script and several concrete techniques get explored: estimating pass rates by simulation shows random guessing hits citizenship-style 20-question tests about 1 in 72 times using a Monte Carlo approach; selecting a random DB row with order by rand forces a full table scan so use id-space sampling or subselects instead; mutation tools like Heckle/Chaser flip operators to reveal untested logic; genetic-space-invaders find an integer overflow exploit; Netflix’s chaos monkey kills random processes to validate resilience.
AI-written summary · about
chapters (19)
- 0:00Intro
- 0:53What is Randomnes
- 2:06Why is it interestin
- 3:37Randomise the slid
- 4:31Entropy
- 9:24Simulated Annealin
- 11:59Select a random ro
- 13:44Mutation testing Heckle is unit test sadism at it's cor
- 16:06Random deploymer
- 17:53A million Random Digits with 100,000 Normal Deviates
- 19:36Monte Carlo
- 21:54Avoiding queue contention
- 29:00BEAN Machine
- 30:01Damn you autocorre
- 30:31Genetic algorithms • A genetic representation - an array of • A fitness function
- 32:14Chaos Monkey
- 33:071969 Draft lottery "The generation of rar numbers is too import left to chance." Robert R Coveyou
- 33:51Newtonian Casino
- 35:11Bloom filters
