bioRxiv · 10.1101/502435
Simulating the Monty Hall problem in a DNA sequencing machine
Abstract
The Monty Hall problem is a decision problem with an answer that is surprisingly counter-intuitive yet provably correct. Here we simulate and prove this decision in a high-throughput DNA sequencing machine, using a simple encoding. All possible scenarios are represented by DNA oligonucleotides, and gameplay decisions are implemented by sequencing these oligonucleotides from specific positions, with a single run simulating more than 12,000,000 independent games. This work highlights high-throughput DNA sequencing as a new tool that could extend existing capabilities and enable new encoding schemes for problems in DNA computing.
Source connections
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mamet, N., Harari, G., Zamir, A., Bachelet, I.. 2018-12-20. Simulating the Monty Hall problem in a DNA sequencing machine. https://doi.org/10.1101/502435
Cite the original work for its findings. Save a collection to share your selection of sources.