Guess Again: The Ehrenfeucht-Mycielski Sequence |
The nice friendly way to play Twenty Questions is to select in your mind a secret something (a person, place, or thing) and to give honest answers to a bunch of true/false questions about it. A les…
The nice friendly way to play Twenty Questions is to select in your mind a secret something (a person, place, or thing) and to give honest answers to a bunch of true/false questions about it. A less nice way to play is to keep changing what you have in mind so that you can answer “No” to every question. That’s not a good way to keep friends, but something very much like it is a good way to generate a quasi-random sequence of bits. Cartoon courtesy of Ben Orlin. Order his new book “Change is the Only Constant” now! First I’ll play nice. I’m thinking of
saved by
related reading
- Perplexityperplexity.ai
- A Mathematical Theory of Communicationpeople.math.harvard.edu
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- An Intuitive Explanation of Solomonoff Induction — LessWronglesswrong.com
- Chaitin's constant - Wikipediaen.wikipedia.org
- book.pdfinference.org.uk
- What Colour are your bits? - Ansuz - mskala's home pageansuz.sooke.bc.ca
- Datacurve | The data engine for frontier AIdatacurve.ai
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- Lecture 1: Introduction to Sequence Prediction | CS 8803 Sequence Predictionthejakeyboy.github.io
- Benford's law - Wikipediaen.wikipedia.org