How can something be enumerable but be un-decidable ie, this states the halting set is un-decidable and enumerable. Enumerable means it can be computed, ie has the same cardinality as natural numbers and can be computed by a program with an output. But if thats the case it should be decidable. Or is decidability separated from computability? Am I misunderstanding the intuition of the halting set?
How can a problem be undecidable yet enumerable?
computability;undecidability;halting problem