Bug#457922: ITP: israndom -- nonclassical randomness test using data compressors

[Rudi Cilibrasi <cilibrar@debian.org>]

Package: wnpp
Severity: wishlist
Owner: Rudi Cilibrasi <cilibrar@debian.org>


* Package name    : israndom
  Version         : 1.0.6
  Upstream Author : Rudi Cilibrasi <cilibrar@cilibrar.com>
* URL             : http://cilibrar.com/
* License         : BSD
  Programming Lang: C
  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
 come 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.

-- System Information:
Debian Release: testing/unstable
  APT prefers stable
  APT policy: (500, 'stable')
Architecture: i386 (i686)
Shell:  /bin/sh linked to /bin/bash
Kernel: Linux 2.6.8-2-686
Locale: LANG=en_US, LC_CTYPE=en_US (charmap=ISO-8859-1)