504 views
0 0 votes

https://gateoverflow.in/86546/theory-of-computation-22

Total recursive functions are similar to   
a) Recursive Languages   b) Recursive Enumerable languages  c) can not relate  d) none

what is partial,preemptive and total recursive function and how related to Mentioned languages????

"Recursive Enumerable language is range of total recursive function"What it means?

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
2 2 answers
3.3k
3.3k views
Mk Utkarsh asked Nov 26, 2017
3,296 views
If total turing machine is a proper subset of turing machine then why recursive language is not a proper subset of Recursive Enumerable ?
3 3 votes
2 answers 2 answers
11.3k
11.3k views
iarnav asked Oct 27, 2017
11,306 views
We know, Recursive Enumerable Language is not closed under complement. a) So, let's say Y is a R.E language and recursive, then what would be Y' (Y complement)?b) Again Y...
1 1 vote
3 answers 3 answers
2.6k
2.6k views
gmrishikumar asked Dec 10, 2018
2,647 views
Halting problem of Turing machines which recognize recursive languages is undecidable. (True / False)
0 0 votes
1 1 answer
1.5k
1.5k views
Anshul Shankar asked Aug 22, 2017
1,523 views
If a language L and its complement L' are recursively enumerable then choose the correct statementa) L is recursive but not L'b) Both L and L' are recursivec) L' is recur...