Can Random Coin Flips Speed Up a Computer?
David Zuckerman
TL;DR
This paper explores how randomness, exemplified by coin flips, can potentially influence computational processes, aiming to make the concept accessible to non-experts.
Contribution
It provides an accessible explanation of the relationship between randomness and computation, highlighting potential impacts on computer speed and efficiency.
Findings
Randomness can be harnessed to improve computational algorithms
Coin flips serve as a simple model for randomness in computation
The essay discusses theoretical and practical implications of randomness in computing
Abstract
This expository essay introduces randomness and computation to a lay audience.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Chaos-based Image/Signal Encryption · Computability, Logic, AI Algorithms