[Nevermark]

I think the interesting problem being described is:

Find two non-trivial algorithms so different that their equivalence is difficult to establish but which will always produce the same results.

Artificial code obfuscation techniques are not allowed. The algorithms can’t just be differently obfuscated versions of each other.

I.e. both algorithms should be in their simplest form given their respective approaches.