Le 10-mai-05, à 08:10, Hal Finney a écrit :
> I'm not sure how to interpret the "z" in "x represents y to z". If a
> computer generates string y from string x, is the computer the z?
>
> And as for Chaitin's algorithmic complexity, I am afraid that you have
> it backward, that it does apply to finite strings. I'm not even sure
> how to begin to apply it to infinite strings.
It applies to both.
The algorithmic complexity of an infinite string is the shortest
program, if it exists, which generates the string.
Modulo some constant it is a well defined notion, although non
constructive. Even for finite strings.
It is misleading to say the UD just generate the strings, as Brent
said. It also interprets them.
Russell: my last post to you was inaccurate I guess everybody see. Not
only I wrote it to quickly but I read your's too quickly too, sorry.
Bruno
http://iridia.ulb.ac.be/~marchal/
Received on Tue May 10 2005 - 07:12:39 PDT