Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Methods and Applications of Algorithmic ComplexityThe Coding Theorem Method

Methods and Applications of Algorithmic Complexity: The Coding Theorem Method [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Methods and Applications of Algorithmic ComplexityThe Coding Theorem Method

Download PDF
49 pages

Loading next page...
 
/lp/springer-journals/methods-and-applications-of-algorithmic-complexity-the-coding-theorem-e9uTnym7aH
Publisher
Springer Berlin Heidelberg
Copyright
© Springer-Verlag GmbH Germany, part of Springer Nature 2022
ISBN
978-3-662-64983-1
Pages
39 –88
DOI
10.1007/978-3-662-64985-5_3
Publisher site
See Chapter on Publisher Site

Abstract

[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.]

Published: May 17, 2022

There are no references for this article.