most recent 30 from http://mathoverflow.net 2013-05-25T14:34:42Z http://mathoverflow.net/feeds/user/18570 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/78281/kolmogorov-complexity-is-not-a-computable-function Max 2011-10-17T20:44:46Z 2011-10-17T20:44:46Z

Of course, "length" of the strings generator greater then Kolmogorov complexity of his output strings. Sorry.

http://mathoverflow.net/questions/78281/kolmogorov-complexity-is-not-a-computable-function Max 2011-10-17T14:15:07Z 2011-10-17T14:15:07Z

Andreas, can you specify a place for further clarification? Thanks.

http://mathoverflow.net/questions/78281/kolmogorov-complexity-is-not-a-computable-function Max 2011-10-17T10:33:18Z 2011-10-17T10:33:18Z

May be I was inaccurate, sorry. More precisely: For checking of desirable complexity by means of K(s) needs a string s; This string must be constructed by means of string generator SG(implicit subroutine hidden in loop(marked in above code)). This SG must be sufficiently complex (at least as N0) for sufficiently complex output s:K(s)'>'N0. Random string generator -complex thing! In some sense SG is adjoint to K?