I am taking a computer theory class and one of the exercises is to prove that the property "doesn't halt for some input" is not semidecidable. This property is the negation of the property "halts for all inputs".
I know that the halting problem is undecidable, but i need some kind of contradition to prove that the negation ("doesn't halt for some input") is not semidecidable as well.