[mcprwklzpq]

Church-Turing thesis is that for every algorithm you can compute you can define a turing machine that can compute it too. You still have show that you can compute answers to your questions about physical world or human cognition.

And we know that we can define an infinite amount of problems that can not ever be computed (or else you can for example solve the halting problem). So there would be infinite amount of questions about the world that we can not ever answer.

And there would be more questions that we can not answer (they are uncountable) than we can answer (they are countable). So if you have a question - chances are such that it can never be answered.

edit: more likely never can be answered.