Kolmogorov structure functions for automatic complexity
Abstract
For a finite word w we define and study the Kolmogorov structure function hw for nondeterministic automatic complexity. We prove upper bounds on hw that appear to be quite sharp, based on numerical evidence.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.