>>11967395>You can't say anything about an idiotic non-question. There is nothing to prove.It’s a well defined question - is the class of decision problems that can be verified with polynomially sized witnesses in polynomial time the same class of decision problems that can be solved in polynomial time? This is a simply posed, rigorous question.
If it had no answer, then prove right here it had none. Otherwise, you’re talking out of your ass.
>Its just a fucking stupid construct from computability theory and information theory No, it’s from complexity. We’re already working with recursive functions. If you want to introduce information theoretic problems here, we could talk about the problem in terms of communication complexity bounds and Karchmer-Wigderson games.
>same way self-organization is a retarded product of systems theory. Based retard doesn’t even understand the problem he’s criticizing.
