The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
29 views
let L be a recursive enumerable language then which of the following is true

(a) complement of L is decidable or undecidable but not semi decidable.

(b)complement of L is undecidable.

(c)complement of L is either decidable or semi decidable

(d) complement of L is undecidable but partially decidable.

I am confused with meaning of semi decidable and partially decidable
asked in Theory of Computation by Active (2.2k points) | 29 views
0
I think both are same..
0
what will be the answer.???explain
0
Complement of RE can be RE(which means REC too) or not RE.

if it is RE, then it is decidable, if it is not RE then it is undecidable.

So we can say that it is either decidable or undecidable but not partially decidable.

(RE is partially decidable)

But those languages which are RE but not REC, their complement is undecidable.

Here nothing is given,that's why I assumed that given RE may or may not be REC too.

Please log in or register to answer this question.

Related questions

0 votes
1 answer
2


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

44,155 questions
49,640 answers
163,333 comments
65,808 users