Sciweavers

4355 search results - page 18 / 871
» Increasing Kolmogorov Complexity
Sort
View
COMSIS
2010
13 years 6 months ago
Metrics for evaluation of metaprogram complexity
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
Robertas Damasevicius, Vytautas Stuikys
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
13 years 8 months ago
L-Printable Sets
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...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 8 months ago
Depth as Randomness Deficiency
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...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 8 months ago
Effective Complexity and its Relation to Logical Depth
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...
Nihat Ay, Markus Mueller, Arleta Szkola
JSYML
2006
86views more  JSYML 2006»
13 years 8 months ago
Degrees of monotone complexity
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...
William C. Calhoun