Hacker News new | ask | show | jobs
by cbogie 926 days ago
given unrestricted compute, could an AI attempt to decipher a completely unknown language through interpreting O(n) brute iterations and reporting versions that are coherent to human heuristics?
2 comments

There are uncountably many “valid” interpretations by this approach. With scant source material there is no way to verify the guessed translation as correct or not.

It’s like “guessing” the encryption key of a one-time pad.

Its a lack of information to verify correctness not a lack of attempts.

One plank of wood is not enough to determine solely if it was intended to be part of a house or part of a boat