Indexed metadata

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness

Jean-Paul Delahaye, Hector Zenil

Source record

Source: Crossref

Published: Sep 1, 2012

DOI: 10.1016/j.amc.2011.10.006

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness — Mathematical Frontier Network