Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kolmogorov structure functions for automatic complexity

Published 2 Sep 2014 in cs.FL and math.LO | (1409.0584v2)

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.

Citations (4)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Bjørn Kjos-Hanssen 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up