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?
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