From: Mike Dougherty (email@example.com)
Date: Mon Oct 06 2008 - 08:42:26 MDT
On Mon, Oct 6, 2008 at 8:58 AM, Matt Mahoney <firstname.lastname@example.org> wrote:
> I think you need to define more precisely what it means for an agent to "know" another's source code. If you mean that agent A can simulate agent's B program such that for any input x, B can predict A(x), then it is not possible for A and B to know each other's code. If A knows B, then K(A) > K(B), where K is Kolmogorov complexity. Therefore it is not possible for B to also know A, which would imply K(B) > K(A). The best you can do is a probabilistic model that allows for some chance of error in predicting either A(x) by B or B(x) by A.
I don't need to model the state of your entire history if it an
accepted fact that you always pause to look both ways before crossing
the street. I can model an exploit against you during that pause and
set a trap near the street crossing to take advantage of a known
quantity that does not require my K(A) > K(B). If I further know your
schedule, I can predict a more efficient time to set the trap (less
waiting = more efficient)
Other than my contrived 2-cent example, I understand and agree with
what you're saying.
This archive was generated by hypermail 2.1.5 : Wed Jun 19 2013 - 04:01:43 MDT