Erik Reuter wrote:
>
> So, if I understand your objection, then the easiest way to state it may
> be:
>
> If a (devious) warden brings in the prisoners in the sequence
> RXXRXXRXX....then my solution never terminates.
>
> Whereas in your solution, there is no such sequence that can stop it
> from terminating.
>
> Is that a correct statement of your objection?
Yes. Your probabilistic solution is still a lot better
than the crude: "Pick a prisoner who will count. When they
reach k visits, have them announce that everyone has visited."
Assuming random visits, P(alligators) goes to zero as k goes
to infinity. Yours is alligator free, but might take infinitely
long (with probability zero).
---David
_______________________________________________
http://www.mccmedia.com/mailman/listinfo/brin-l
