The Coding Theorem Method

Hector Zenil,Fernando Soler Toscano,Nicolas Gauvrit

Methods and Applications of Algorithmic Complexity Emergence, Complexity and Computation（2022）

Karolinska Institutet

被引用0|浏览0

摘要

The algorithmic complexity (hence also called program-size complexity) of a bit string is defined as the length of the shortest binary computer program that prints out the string (see ( 1.8 ) in Sect. 1.3 ). However, no general, finite and deterministic procedure exists to calculate algorithmic complexity. For a given string there are infinite many programs producing it.

更多

查看译文

关键词

Turing Machines,Algorithmic Information Theory,Computational Depth,Algorithms,Text Indexing

上传PDF