I am reviewing some old papers for a final tomorrow, and there is a question that I'm not sure about.
If a language A is Turing-Recognizable and Undecidable, what can be said of the Turing-Machine that recognizes the complement of A?
To my understanding this turing machines accept states, are all those that were of the rejection states in the first Turing Machine. Also seeing as the Language is undecidable, this Turing Machine will not halt for strings that are not in the language.
Can someone please tell me if my understanding is correct or not, and if not give me some clarification?