[ddp] israndom : nonclassical randomness test using data compressors

[daily-debian-package at enix.org]

Hello,

Today, I'm happy to present you the Debian package israndom, which is
part of the science section, and maintained by Rudi Cilibrasi
<cilibrar at debian.org>. 

This package contains : 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.



Package homepage     :
 http://packages.debian.org/unstable/science/israndom

Package bug homepage :
 http://bugs.debian.org/israndom

Package QA homepage  :
 http://packages.qa.debian.org/israndom

Have fun with Debian packages !

-- 
Daily Debian package, by Thomas Petazzoni, thanks to Jérome Petazzoni
Daily-debian-package at the-doors.enix.org
http://the-doors.enix.org/cgi-bin/mailman/listinfo/daily-debian-package
http://thomas.enix.org/DebianPackageDay