# Complexity classes for various models of computation

The various complexity classes usually taught and studied ($$P$$, $$NP$$ $$co-NP$$, EXP, NSPACE etc) are usually defined using Turing Machines as the preferred model of computation.

Are these sets of decision problems (complexity classes) independent of the model of computation used?

• It depends on the model of computation... but many of these classes are quite robust. – Yuval Filmus Sep 17 '19 at 14:16