The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
67 views

As all recursive languages are recursively enumerable languages, they also should be Turing Recognizable together with Turing Decidable. This was my logic behind marking the 4th option which says all of the mentioned statements are true.

Correct me if I am wrong 

asked in Theory of Computation by Junior (643 points)
retagged by | 67 views

1 Answer

+1 vote

Your answer is Correct as well as your logic.  Recursively enumerable aka Formal language aka  recognizable aka partially decidable aka semidecidable aka Turing-acceptable aka Turing-recognizable.

answered by Boss (17.5k points)
edited by
0

Pata nhi kya foonk ke Question/Answer set karte hain kabhi kabhi.. Ask them what is this new weed called.

try to not use these words 

0
My bad. Apologies. Corrected.


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

38,106 questions
45,608 answers
132,246 comments
49,233 users