Hmm. Is the analogy of secure crypto algorithms to cheat-proof search algorithms spurious?
(I.e., is it possible to build search algorithms that can't be subverted by malicious actors even if the algorithm is known to those malicious actors?)
I'm not seeing a way to do it, but then again, I'm not seeing a strong proof of impossibility, either.
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
(no subject)
Date: 2008-01-03 03:06 am (UTC)(I.e., is it possible to build search algorithms that can't be subverted by malicious actors even if the algorithm is known to those malicious actors?)
I'm not seeing a way to do it, but then again, I'm not seeing a strong proof of impossibility, either.