When it comes to theory of computability, you don’t need to account for optimization techniques. No need to consider the practicality of getting an answer from the algorithm, like how long it takes or how much memory it requires. Either you can get an answer in finite amount of time, or you can not.

But I agree it’s sus when it comes to making such strong statements about the compatibility of the reality. I don’t trust this paper makes all the right assumptions.