I'm confused. Do p-computers have any complexity theoretic advantage over classical computers, similar to how quantum computers have such an advantage in some areas? Or are they just normal computers in the end?
The answer should be no right? I think BPP is expected to be equal to P and BQP to be not equal to P.
by complexity class that would be consensus, although the argument for building BPP systems is about the energy cost being orders of magnitude less and perhaps also some polynomial speedup
P-computers is just another name for legume-computers, which are great for bean-counting, and are deployed in pods.