701 search results - page 16 / 141 » Kolmogorov complexity in perspective |
SIAMCOMP
1998
13 years 7 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
JSYML
2006
13 years 7 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
INFORMATICALT
2010
13 years 6 months ago
2010
The genetic information in cells is stored in DNA sequences, represented by a string of four letters, each corresponding to a definite type of nucleotides. Genomic DNA sequences a...