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