README.md~

# The Online Algorithmic Complexity Calculator v3.0
## R Shiny App


[R Shiny](http://shiny.rstudio.com/) code for the [Online Algorithmic Complexity Calculator](http://complexitycalculator.com/) version 3.0 by the [Algorithmic Nature Group](http://algorithmicnaturelab.org/) and the [Algorithmic Dynamics Lab](http://www.algorithmicdynamics.net/). 

To run this app locally, download [R Studio](https://www.rstudio.com/) and follow the instructions [here](http://shiny.rstudio.com/tutorial/lesson1/). 


Our Block Decomposition Method to estimate [Kolmogorov complexity](http://www.scholarpedia.org/article/Algorithmic_complexity) in strings and graphs of arbitrary size is described in **[A Divide-and-Conquer Method for Local Estimations of Algorithmic Complexity Lower Bounded by Shannon Entropy](https://arxiv.org/pdf/1609.00110.pdf)** by H. Zenil, F. Soler-Toscano, N.A. Kiani, S. Hernández-Orozco, and A. Rueda-Toicen. 

The Coding Theorem Method and the Block Decomposition Method are also described in  **[Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines](http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0096223)** by F. Soler-Toscano, H. Zenil, J.-P. Delahaye and N. Gauvrit. 

If you make use of results from this calculator, please make sure to visit [How To Cite](http://complexitycalculator.com/HowToCite.html).

This app uses the [acss package](https://cran.r-project.org/web/packages/acss/index.html) available at CRAN, and maintained by Henrik Singmann.

## License

[GNU Affero General Public License v3.0](http://choosealicense.com/licenses/agpl-3.0)

#### Maintainer

[Antonio Rueda-Toicen](http://www.digital-spaceti.me/)

antonio.rueda.toicen " at "  algorithmicnaturelab (-dot-) org

#### [www.complexitycalculator.com](www.complexitycalculator.com)

#### [www.algorithmicnaturelab.org](www.algorithmicnaturelab.org)