The frequent paucity of trivial strings
نویسندگان
چکیده
منابع مشابه
The Frequent Paucity of Trivial Strings
A 1976 theorem of Chaitin can be used to show that arbitrarily dense sets of lengths n have a paucity of trivial strings (only a bounded number of strings of length n having trivially low plain Kolmogorov complexities). We use the probabilistic method to give a new proof of this fact. This proof is much simpler than previously published proofs, and it gives a tighter paucity bound.
متن کاملOn Strings with Trivial Kolmogorov Complexity
The Kolmogorov complexity of a string is the length of the shortest program that generates it. A binary string is said to have trivial Kolmogorov complexity if its complexity is at most the complexity of its length. Intuitively, such strings carry no more information than the information that is inevitably coded into their length (which is the same as the information coded into a sequence of 0s...
متن کاملTrivial Spectrum of Free 1+1 Light-cone Strings *
The BRST cohomology of 1+1 strings in a free light-cone gauge contains only the two-dimensional tachyon, and excludes all excited states of both matter and ghosts, including the special states that arise in the continuum conformal gauge quantization and in the c = 1 matrix models. This exclusion takes place at a very basic level, and therefore may signal some serious problems or at least unreso...
متن کاملThe Properties and Further Applications of Chinese Frequent Strings
This paper reveals some important properties of CFSs and applications in Chinese natural language processing (NLP). We have previously proposed a method for extracting Chinese frequent strings that contain unknown words from a Chinese corpus [Lin and Yu 2001]. We found that CFSs contain many 4-character strings, 3-word strings, and longer n-grams. Such information can only be derived from an ex...
متن کاملFinding Frequent Elements in Compressed 2D Arrays and Strings
We show how to store a compressed two-dimensional array such that, if we are asked for the elements with high relative frequency in a range, we can quickly return a short list of candidates that includes them. More specifically, given an m × n array A and a fraction α > 0, we can store A in O ( mn(H + 1) log(1/α) ) bits, where H is the entropy of the elements’ distribution in A, such that later...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2014
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2014.05.006