>>13314411Yes. All mathematical problems can be stated as Pi^1 arithmetical statements, which basically say a certain algorithm which you can run in the real world halts. A naive translation of some questions may make it seem like an arithmetical problem of higher complexity, and such statements are empirically meaningless, but in reality you just want a proof or disproof of that statement in a given formal system, which is a Pi^1 problem. The halting of an algorithm is a question about the natural world, whether a given natural process terminates or not. If you knew the laws of physics and could deterministically predict the future given an initial state, you could see if an algorithm halts or not.
