/explore
|
You are here 
|
paperman.name | ||
| | | | |
www.jeremykun.com
We are about to begin a series where we analyze large corpora of English words. In particular, we will use a probabilistic analysis of Google's ngrams to solve various tasks such as spelling correction, word segmentation, on-line typing prediction, and decoding substitution ciphers. This will hopefully take us on a wonderful journey through elementary probability, dynamic programming algorithms, and optimization. As usual, the code implemented in this post is available from this blog's Github page, and we encourage the reader to use the code to implement our suggested exercises. |
|
| | | | | ||
| | | | |
rjlipton.com
See a number, make a set Henning Bruhn and Oliver Schaudt are mathematicians or computer scientists, or both. They are currently working in Germany, but wrote their survey on the Frankl Conjecture (FC) while working together in Paris. Schaudt is also known as an inventor of successful mathematical games. Today Ken and I wish to... |
|
| | | | | ||
| | | | |
irisvanrooijcogsci.com
Trolley problems are commonly used as thought experiments in philosophy of ethics. One can regularly see new variants come by on Twitter: some are just poking fun, others are bringing the ethical dilemma to new levels of complexity. Recently, the variant below caught my eye. This combinatorial trolley problem seemed interesting from a computational complexity... |
|
| | | | | ||
| | | | |
rsdoiel.github.io
|
|
| | | |||
