| Paketname | israndom |
| Beschreibung | nonclassical randomness test using data compressors |
| Archiv/Repository | Offizielles Debian Archiv squeeze (main) |
| Version | 1.0.7-3 |
| Sektion | science |
| Priorität | optional |
| Installierte Größe | 64 Byte |
| Hängt ab von | libc6 (>= 2.1), libcomplearn1, libglib2.0-0 (>= 2.12.0), libgsl0ldbl (>= 1.9), libxml2 (>= 2.6.27) |
| Empfohlene Pakete | |
| Paketbetreuer | Rudi Cilibrasi |
| Quelle | |
| Paketgröße | 11098 Byte |
| Prüfsumme MD5 | 188d64441657a891cd5784b292d6606b |
| Prüfsumme SHA1 | 2b5061a35a78d60486f7db4a47aa39cc6c2276f4 |
| Prüfsumme SHA256 | a5beef9b1ba7148b4546dff27b8f0a2d4ebe2882b51656a483b183cdfea76ecb |
| Link zum Herunterladen | israndom_1.0.7-3_i386.deb |
| Ausführliche Beschreibung | israndom tests a sequence of symbols for randomness. israndom tries to
determine if a given sequence of trials could reasonably be assumed to
be from a random uniform distribution over a fixed-size alphabet of
2-256 symbols. It uses mathematical results from Kolmogorov Complexity
theory and Shannon entropy (in classical information theory) in order to
determine if a given sequence is effectively random or not. It does this
by bounding the Kolmogorov complexity function from above using compressors.
.
|