Explore >> Select a destination
|
You are here 
|
paperman.name | ||
| | | | |
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... | |
| | | | |
blog.quarkslab.com
|
|
| | | | | In this blogpost, we present a general method to efficiently compare functions from a new binary against a large database (made of numerous known functions). This method has strong theoretical properties and is perfectly suited to address many conventional problems, such as classification, clustering or near duplicate detection. | |
| | | | |
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 w... | |
| | | | |
xorshammer.com
|
|
| | | There are many functions from $latex \mathbb{N}$ to $latex \mathbb{N}$ that cannot be computed by any algorithm or computer program. For example, a famous one is the halting problem, defined by $latex f(n) = 0$ if the $latex n$th Turing machine halts and $latex f(n) = 1$ if the $latex n$th Turing machine does not... | ||
