1,420 views
2 votes
2 votes
I totally understand the Halting problem, what about complement of halting problem? Is this the set of all those language which never halts? Why complement of halting problem is not re? Proof plz

Please log in or register to answer this question.

Related questions

5 votes
5 votes
2 answers
2
Kapil asked Sep 27, 2016
2,064 views
Can anyone provide the proof of halting problem of turing machines by contradiction ? If possible, give example, how is it reduced to other turing problems ?
2 votes
2 votes
1 answer
3
monty asked Oct 26, 2016
775 views
0 votes
0 votes
3 answers
4
Parimal Paritosh asked Sep 20, 2017
3,838 views
Please give me an example of adding two negative numbers using 2's complement number system.Let's say:-7 + (-6)