Maximizing T-complexity

DOI10.3233/FI-2015-1223MaRDI QIDQ2804173zbMATH OpenOpenAlexFDO

Authors Gregory Clark, Jason Teutsch

Publication date 28 April 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1223

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• A linearly computable measure of string complexity
• scientific article; zbMATH DE number 1747450
• A note on the number of N-bit strings with maximum complexity
• Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
• Methods and applications of algorithmic complexity. Beyond statistical lossless compression

Cited in

(2)

• Exact Worst Case TCAM Rule Expansion
• A linearly computable measure of string complexity

This page was built for publication: Maximizing T-complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804173)