Kolmogorov structure functions for automatic complexity

Bjørn Kjos-Hanssen

doi:10.1007/978-3-319-12691-3_49

Kolmogorov structure functions for automatic complexity

Formal Languages and Automata Theory 2020-01-31 v2 Logic

Authors: Bjørn Kjos-Hanssen

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

For a finite word $w$ we define and study the Kolmogorov structure function $h_w$ for nondeterministic automatic complexity. We prove upper bounds on $h_w$ that appear to be quite sharp, based on numerical evidence.

Keywords

algebraic theory

Cite

@article{arxiv.1409.0584,
  title  = {Kolmogorov structure functions for automatic complexity},
  author = {Bjørn Kjos-Hanssen},
  journal= {arXiv preprint arXiv:1409.0584},
  year   = {2020}
}

Comments

Preliminary version: "Kolmogorov structure functions for automatic complexity in computational statistics", Lecture Notes in Comput. Sci., vol. 8881, Springer, Cham, 2014, 652--665, 8th International Conference on Combinatorial Optimization and Applications (COCOA 2014)

Kolmogorov structure functions for automatic complexity

Abstract

Keywords

Cite

Comments

Related papers