Question

I need to prove follow:

Let be a semi-decidable language. Then the language $$L^*$$ (Kleene star) is semi-decidable.

Answer 1

1). ANSWER :

GIVENTHAT :

Lis kleene star operator, it follows that L&ERE semi-decidable Language semi from decidable. It is tocce. In It is not true. I thought of Peo, that Slace every it follows that Language is acutomatically LERE, and since RE is closed under the is semi-decided by some proof! 1) Every RE Language Turing machine. There are only countably many Turing machines but there are uncountably many language. 2) If a Language and its complement are both semi-decidable, they are, in fact, both decidable. The halting problem is semi- decidable. 3) If the complement of the halting problem were seme decidable the halting problem would be decidable the halting problem is not decidable L {ablar & ty .: KLAI ndahet since lab*b semidecidable then both it and But we know that the L & semi decolable which is contradiction.