is halting problem recursively enumerable?
The Halting Problem. Therefore HALT is recursively enumerable since it is accepted by U. The essence of the Halting problem is that HALT, which is recursively enumerable, or semi-decidable, is not recursive, i.e., not decidable.