0 votes 0 votes A is Recursively Enumerable but not recursive and A reduces to B then which of the following can be true? A) B is Recursive B) B is Recursive Enumerable C) B is Not RE D) B is CFL Theory of Computation theory-of-computation reduction + – Mk Utkarsh asked Sep 19, 2018 • edited Sep 19, 2018 by Mk Utkarsh Mk Utkarsh 531 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments daksirp commented Sep 19, 2018 reply Follow Share @Arjun : sir then, is it " 'B' can be as hard as A or 'B' can be harder than 'A' . ? if it is then, 'B' can be "RE but Not REC" too, or 'B' can be 'NOT RE' . but how 'B' can be RE ?. as if we consider 'B' as 'RE', then there exists a subset of 'REC' in RE. where am i going wrong ? 0 votes 0 votes Mk Utkarsh commented Sep 19, 2018 reply Follow Share both B and C are correct. 1 votes 1 votes daksirp commented Sep 19, 2018 reply Follow Share @utkarsh, did u get my point. Why B is correct ? See my response to Arjun sir 0 votes 0 votes Please log in or register to add a comment.