About the work
The method introduced in my doctoral dissertation was featured in the French version of Scientific American Pour La Science in its July 2011 issue No. 405 under the title Le défi des faibles complexités. Jean-Paul Delahaye points out that: Comme les très petites durées ou longueurs, les faibles complexités sont délicates à évaluer. Paradoxalement, les [...]
<http://feeds.feedburner.com/~ff/AnimaExMachina?a=2d__n0lQMbQ:XUCidLYZUSs:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=2d__
Print work information
Work information
Title An alternative method (to compression) for approximating the algorithmic complexity of strings
The method introduced in my doctoral dissertation was featured in the French version of Scientific American Pour La Science in its July 2011 issue No. 405 under the title Le défi des faibles complexités. Jean-Paul Delahaye points out that: Comme les très petites durées ou longueurs, les faibles complexités sont délicates à évaluer. Paradoxalement, les [...]
<http://feeds.feedburner.com/~ff/AnimaExMachina?a=2d__n0lQMbQ:XUCidLYZUSs:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=2d__
Work type Article
Tags foundations of computation, algorithmic information theory, new ideas
-------------------------
Registry info in Safe Creative
Identifier 1107209717780
Entry date Jul 20, 2011, 9:20 PM UTC
License Creative Commons Attribution Non-commercial No Derivatives 3.0
-------------------------
Copyright registered declarations
Author. Holder Hector Zenil Chavez. Date Jul 20, 2011.
Information available at https://www.safecreative.org/work/1107209717780-an-alternative-method-to-compression-for-approximating-the-algorithmic-complexity-of-strings
/
Registration: 1107209717780
