# example of complexity class that does not have complete problems

Many known complexity classes have complete problems; however, according to what I heard, not all complexity classes have complete problems.

So, what are some examples of the complexity classes that do not have complete problems?

And if they exist, will they contain small number of decision problems? (e.g. not being infinite and be small?)

-
It's always good to check Wikipedia en.wikipedia.org/wiki/Complete_problem – sdcvvc May 8 '12 at 14:22

A typical example is PH, the polynomial hierarchy. Although every level of the hierarchy has complete problems (with respect to polynomial-time Karp-reduction), if there is a complete problem for the whole hierarchy than it collapses, which is considered unlikely (however, there is no proof it doesn't happen; such a proof will show that $P\ne NP$).