The Online Algorithmic Complexity Calculator. The Online Algorithmic Complexity Calculator (OACC) is an on-going long-term project of the Algorithmic Nature Group to develop an online tool implementing semi-computable measures of complexity through various numerical methods and algorithms for potential applications in a very wide range of disciplines, from bioinformatics to psychometrics, from linguistics to economics. It currently retrieves numerical approximations (upper bounds) of Kolmogorv complexity for binary strings of short length by means of algorithmic probability (notably by using the algorithmic Coding theorem relating frequency and complexity), for string length which lossless compression algorithms fail to deal with, hence providing an alternative/complementary method to compression algorithms (in the future the calculator will smoothly make the transition between the algorithmic probability and the lossless compression methods using a technique that the group has developed called the Block Decomposition Method. More algorithmic information measures, more data and more techniques will be incorporated gradually in the future, covering a wider range of objects such as longer binary strings, non-binary strings and n-dimensional objects (such as images). Data and tools such as an R package and a Mathematica notebook are also available.
Keywords for this software
References in zbMATH (referenced in 6 articles )
Showing results 1 to 6 of 6.
- Ma, Lin; Delahaye, Jean-Paul: An algorithmic look at financial volatility (2018)
- Prade, Henri; Richard, Gilles: Analogical proportions: from equality to inequality (2018)
- Morzy, Mikołaj; Kajdanowicz, Tomasz; Kazienko, Przemysław: On measuring the complexity of networks: Kolmogorov complexity versus entropy (2017)
- Soler-Toscano, Fernando; Zenil, Hector: A computable measure of algorithmic probability by finite approximations with an application to integer sequences (2017)
- Zenil, Hector; Soler-Toscano, Fernando; Dingle, Kamaludin; Louis, Ard A.: Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks (2014)
- Soler-Toscano, Fernando; Zenil, Hector; Delahaye, Jean-Paul; Gauvrit, Nicolas: Correspondence and independence of numerical evaluations of algorithmic information measures (2013)
Further publications can be found at: http://algorithmicnature.org/publications/