Provides a general toolkit for downloading, managing,
analyzing, and presenting data from the U.S. Census, including SF1
(Decennial short-form), SF3 (Decennial long-form), and the American
Community Survey (ACS).  Confidence intervals provided with ACS data
are converted to standard errors to be bundled with estimates in
complex acs objects.  Package provides new methods to conduct
standard operations on acs objects and present/plot data in
statistically appropriate ways.

Provides a general toolkit for downloading, managing,
analyzing, and presenting data from the U.S. Census
(<https://www.census.gov/data/developers/data-sets.html>), including
SF1 (Decennial short-form), SF3 (Decennial long-form), and the
American Community Survey (ACS).  Confidence intervals provided with
ACS data are converted to standard errors to be bundled with
estimates in complex acs objects.  Package provides new methods to
conduct standard operations on acs objects and present/plot data in
statistically appropriate ways.

Algorithmic Complexity for Short Strings
c( person("Nicolas", "Gauvrit", role = "aut"),
person("Fernando", "Soler Toscano", role = "aut"),
person("Hector", "Zenil", role = "aut"),
person("Henrik", "Singmann",
email = "singmann@gmail.com", role =
c("aut", "cre")))
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
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.
Nicolas Gauvrit [aut],
Fernando Soler Toscano [aut],
Hector Zenil [aut],
Henrik Singmann [aut, cre]

c( person("Nicolas", "Gauvrit", role = "aut"), person("Henrik",
"Singmann", email = "singmann@gmail.com", role = c("aut", "cre")),
person("Fernando", "Soler Toscano", role = "ctb"), person("Hector",
"Zenil", role = "ctb") )
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.
Nicolas Gauvrit [aut],
Henrik Singmann [aut, cre],
Fernando Soler Toscano [ctb],
Hector Zenil [ctb]