1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
Source: israndom
Priority: optional
Maintainer: Rudi Cilibrasi <cilibrar@debian.org>
Build-Depends: debhelper (>= 4.1.0), libcomplearn-dev, g++-4.2
Standards-Version: 3.7.3
Vcs-Browser: http://hg.debian.org/hg/private/cilibrar/pkg-israndom
Vcs-Hg: http://hg.debian.org/hg/private/cilibrar/pkg-israndom
Section: science
Package: israndom
Section: science
Depends: ${shlibs:Depends}, ${misc:Depends}
Architecture: any
Description: nonclassical randomness test using data compressors
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.
.
|
