Kolmogorov structure functions for automatic complexity
نویسندگان
چکیده
منابع مشابه
Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics
For a finite word w of length n and a class of finite automata A, we study the Kolmogorov structure function hw for automatic complexity restricted to A. We propose an approach to computational statistics based on the minimum p-value of hw(m) over 0 ≤ m ≤ n. When A is the class of all finite automata we give some upper bounds for hw. When A consists of automata that detect several success runs ...
متن کاملKolmogorov Complexity and Solovay Functions
Solovay [19] proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f(x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) ≤ f(x)+O(1) for all x and f(x) ≤ K(x) + O(1) for infinitely many x, which we call Solovay functions. We show that Solovay functions present interesting conne...
متن کاملAutomatic Kolmogorov Complexity and Normality Revisited
It is well known that normality (all factors of given length appear in an infinite sequence with the same frequency) can be described as incompressibility via finite automata. Still the statement and proof of this result as given by Becher and Heiber [4] in terms of “lossless finite-state compressors” do not follow the standard scheme of Kolmogorov complexity definition (the automaton is used f...
متن کاملKolmogorov complexity and generalized length functions
Kolmogorov complexity measures the algorithmic complexity of a finite binary string σ in terms of the length of the shortest description σ∗ of σ. Traditionally, the length of a string is taken to measure the amount of information contained in the string. However, we may also view the length of σ as a measure of the cost of producing σ, which permits one to generalize the notion of length, where...
متن کاملOn the Kolmogorov Complexity of Continuous Real Functions
Kolmogorov complexity was originally defined for finitely-representable objects. Later, the definition was extended to real numbers based on the asymptotic behaviour of the sequence of the Kolmogorov complexities of the finitely-representable objects—such as rational numbers—used to approximate them. This idea will be taken further here by extending the definition to functions over real numbers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.05.052