>an effective equivalent to the second law of thermodynamics for information systems: P=/=NP.
This is not true. For example, the second law is only a statistical claim - the larger the system, the more likely it holds. But the second law is not a law against entropy ever going the other way. It's entirely possible, but not likely that another universe pops out of a quantum fluctuation at any moment. See the concept of a Boltzmann Brain for where physicists think this leads.
And P != NP is not a law at all - it's a guess, since no one knows if it's true. Complexity classes certainly changed with the introduction of quantum computer, allowing (very) few problems with known exponential classical Turing time to be done in polynomial quantum Turing time. It is also known that if closed timelike loops are allowed in computation then P=NP, but it's not known if we can engineer such physical items.
>The claims often made about the transcendent nature of the laws governing "the market" violate the computational properties of reality as we understand it
As evidence of the falsity of the above claims, TQFTs routinely compute NP hard problems, which is why for some time Friedman has tried to leverage them to solve NP hard computational problems.
Here's [1] but one paper showing this to be true. "Non-Abelian topological quantum field theories exhibit the mathematical features necessary to support a model capable of solving all ⧣P problems, a computationally intractable class, in polynomial time. "
Roughly, TQFTs perform certain "computations" on knots in polynomial time that are known to be NP hard in classical or current quantum computing models.
[2] is another nice take in Annals of Mathematics, the most prestigious journal in math.
Thus reality routinely solves NP hard problems. Thus your claims are not true.
This is not true. For example, the second law is only a statistical claim - the larger the system, the more likely it holds. But the second law is not a law against entropy ever going the other way. It's entirely possible, but not likely that another universe pops out of a quantum fluctuation at any moment. See the concept of a Boltzmann Brain for where physicists think this leads.
And P != NP is not a law at all - it's a guess, since no one knows if it's true. Complexity classes certainly changed with the introduction of quantum computer, allowing (very) few problems with known exponential classical Turing time to be done in polynomial quantum Turing time. It is also known that if closed timelike loops are allowed in computation then P=NP, but it's not known if we can engineer such physical items.
>The claims often made about the transcendent nature of the laws governing "the market" violate the computational properties of reality as we understand it
As evidence of the falsity of the above claims, TQFTs routinely compute NP hard problems, which is why for some time Friedman has tried to leverage them to solve NP hard computational problems.
Here's [1] but one paper showing this to be true. "Non-Abelian topological quantum field theories exhibit the mathematical features necessary to support a model capable of solving all ⧣P problems, a computationally intractable class, in polynomial time. "
Roughly, TQFTs perform certain "computations" on knots in polynomial time that are known to be NP hard in classical or current quantum computing models.
[2] is another nice take in Annals of Mathematics, the most prestigious journal in math.
Thus reality routinely solves NP hard problems. Thus your claims are not true.
[1] https://www.pnas.org/content/95/1/98 [2] https://annals.math.princeton.edu/wp-content/uploads/annals-...