From: Peter de Blanc (firstname.lastname@example.org)
Date: Wed Nov 26 2008 - 16:52:05 MST
Matt Mahoney wrote:
>> Matt, RSI gains O(log t) bits compared to a Kolmogorov
>> prior, while evolution gains O(t) bits compared to a uniform
>> prior. You can't compare these two quantities.
> No, evolution gain has an upper bound of O(t) measured by Kolmogorov complexity. (It might be less). It does not matter how information is inherited. Each fitness decision that results in death with 50% probability transmits one bit of information.
> -- Matt Mahoney, email@example.com
OK, I agree that this is an upper bound. Unless you can prove a *lower*
bound, this doesn't allow you to compare evolution favorably to RSI.
This archive was generated by hypermail 2.1.5 : Wed Jun 19 2013 - 04:01:43 MDT