That’s the Chuch-Turing thesis, combined with computational semantics. Computational semantics gives us formal logical statements for anything you might want to say, the Church-Turing thesis states that computational processes are equivalent to these logical formalisms, and you’ve accepted that any computational process can be represented in English (if verbosely).

The only exception would be things not express able on our semantic models which you might want to say. No one has ever been able to offer up an example of something that couldn’t be represented in a logical formalism, so…