ComplexSystems

10 ms·

1. 391.▲
   by ComplexSystems 8y ago

   Interesting. Could this perform even faster if you (for large files) took a random sample of bytes before doing the search, to get the best distribution? Or just update the distribution as the search progresses.
2. 392.▲
   by ComplexSystems 8y ago

   How do the results change if you use multiplicative error rather than additive error? That is, rather than |x-p/q|, you use max(x/(p/q), (p/q)/x). This is sometimes useful when trying to approximate rationals.
3. 393.▲
   Richard Feynman and the Connection Machine (1989)(longnow.org)

   2 points by ComplexSystems 8y ago|0 comments
4. 394.▲
   by ComplexSystems 8y ago

   There are, I dunno, maybe 1,000,000 words in the English language. With a book cipher, almost all books will produce gibberish words not on the list. If you find one for which almost all words are magically on that list of 1,000,000 words