Abstract
For a finite word we define and study the Kolmogorov structure function for nondeterministic automatic complexity. We prove upper bounds on that appear to be quite sharp, based on numerical evidence.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.