Kolmogorov complexity and cellular automata classification

Author： Dubacq J.-C. Durand B. Formenti E.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 271-285

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Learning cellular automata rules for binary classification problem

By Piwonska Anna

The Journal of Supercomputing, Vol. 63, Iss. 3, 2013-03 ,pp. : 800-815

Springer Publishing Company

Access to resources Recommend Favorite

Kolmogorov complexity and non-determinism

By Grigorieff S. Marion J.

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 151-180

Elsevier

Access to resources Recommend Favorite

The Kolmogorov complexity of real numbers

By Staiger L.

Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. : 455-466

Elsevier

Access to resources Recommend Favorite

Logical operations and Kolmogorov complexity

By Shen A. Vereshchagin N.

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 125-129

Elsevier

Access to resources Recommend Favorite

Combinatorial interpretation of Kolmogorov complexity

By Romashchenko A. Shen A. Vereshchagin N.

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 111-123

Elsevier

Access to resources Recommend Favorite