Polynomial complexity classes over real algebras with nilpotent elements
We consider a computational complexity theory over arbitrary algebraic structures by Rybalov based on the approach to generalized computability developed by Ashaev, Belyaev and Miasnikov. Let A be an algebra over R with a nilpotent element. We prove that analogs of the classical computational complexity classes P and NP over A are different.