Sciweavers

4355 search results - page 11 / 871
» Increasing Kolmogorov Complexity
Sort
View
IANDC
2011
69views more  IANDC 2011»
13 years 3 months ago
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. ...
APAL
2006
67views more  APAL 2006»
13 years 8 months ago
On partial randomness
If x = x1x2
Cristian S. Calude, Ludwig Staiger, Sebastiaan Ter...
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
14 years 1 months ago
The complexity of stochastic sequences
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
Wolfgang Merkle
MCU
2007
95views Hardware» more  MCU 2007»
13 years 10 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud