Let be a class of languages and We say is -Complete if it is -Hard Language. Examples Computability Hierarchy Any Computable language is -complete The Halting Problem is -complete