# --------------------------------------------
# CITATION file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# --------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "acss" in publications use:'
type: software
license: GPL-2.0-or-later
title: 'acss: Algorithmic Complexity for Short Strings'
version: 0.2-5
identifiers:
- type: doi
  value: 10.32614/CRAN.package.acss
abstract: '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.'
authors:
- family-names: Gauvrit
  given-names: Nicolas
- family-names: Singmann
  given-names: Henrik
  email: singmann+acss@gmail.com
preferred-citation:
  type: article
  title: 'Algorithmic complexity for psychology: A user-friendly implementation of
    the coding theorem method'
  authors:
  - family-names: Gauvrit
    given-names: Nicolas
  - family-names: Singmann
    given-names: Henrik
    email: singmann+acss@gmail.com
  - family-names: Soler-Toscano
    given-names: Fernando
  - family-names: Zenil
    given-names: Hector
  journal: arXiv
  year: '2014'
  volume: abs/1409.4080
  url: http://arxiv.org/abs/1409.4080
repository: https://CRAN.R-project.org/package=acss
url: http://complexitycalculator.com/methodology.html
date-released: '2014-11-23'
contact:
- family-names: Singmann
  given-names: Henrik
  email: singmann+acss@gmail.com