The question is about computability, in the sense it's asking to recognize the possibility of an unknown (trivial) computable function. The "God stuff" is an d

The question is about computability, in the sense it's asking to recognize the possibility of an unknown (trivial) computable function. The "God stuff" is an distraction, with modal-logic ambiguities as another commenter wrote. I just wrote a regular expression (a real one, not PCRE), and then deleted it, and dissolved my computer in acid. It is completely impossible to ever know what I wrote. Was that function computable? Then I got another computer and wrote a program in a Turing Complete language, and deleted and dissolved that computer in acid. Was that program computable?