By Matiyasevich's theorem, each member of computably enumerable set can be obtain from a diophantine equation system. For prime numbers, this system of diophantine equation is found. My question is: For
For special computably enumerable set as like as square numbers or perfect numbers, how can we construct this diophantine equation system?
Is there Matiyasevich's type theorem for the matrix algebra?