| Name : R-acss
| |
| Version : 0.2.5
| Vendor : obs://build_opensuse_org/devel:languages:R
|
| Release : lp153.2.13
| Date : 2024-06-14 11:35:32
|
| Group : Development/Libraries/Other
| Source RPM : R-acss-0.2.5-lp153.2.13.src.rpm
|
| Size : 0.05 MB
| |
| Packager : (none)
| |
| Summary : Algorithmic Complexity for Short Strings
|
Description :
Main functionality is to provide the algorithmic complexity for short
strings, an approximation of the Kolmogorov Complexity of a short
string using the coding theorem method (see ?acss). The database
containing the complexity is provided in the data only package
acss.data, this package provides functions accessing the data such as
prob_random returning the posterior probability that a given string was
produced by a random process. In addition, two traditional (but
problematic) measures of complexity are also provided: entropy and
change complexity.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/R:/autoCRAN/openSUSE_Leap_15.3/x86_64 |
