[r-t] Complexity of extents

Richard Smith richard at ex-parrot.com
Tue Jun 18 19:45:16 UTC 2013

Alexander Holroyd wrote:

> This is an interesting and ptoentially tricky area.
> In some sense the "true" measure is Kolmogorov Complexity, but that is a a 
> non-computable function.

It's worse than non-computable.  It doesn't a defined value 
at all (other than, perhaps, for the case of an empty 
string).  Almost any result you might want to use involves 
one or more unknown but finite constant.  The result is that 
you can only sensibly talk about the complexities of things 
as they tend to the limit of being infinitely long (where 
you can ignore all the unknown finite constants).  But that 
makes no sense for an extent.


More information about the ringing-theory mailing list