edited by
530 views

2 Answers

Best answer
2 votes
2 votes

Total Recursive Functions are functions that are defined for every integer of the set f(i1,i2,....,in). For example, all arithmetic functions like multiplication,n! etc are total recursive functions. Such functions are similar to the class of Recursive languages as they are computable by Turing Machines that always halt.

So, option (a) is the correct response to the question.

selected by
0 votes
0 votes
Total Recursive Functions — Recursive Languages aka Decidable languages. (Can say "yes" and "no")

 

Partial Recursive Functions — Recursively Enumerable Languages aka Undecidable languages aka Semidecidable languages aka Partially decidable languages. (Can say "yes", but may or may not say "no")
Answer:

Related questions

6 votes
6 votes
2 answers
1
Bikram asked Nov 26, 2016
1,174 views
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is:DecidableUndecidable but semi-decida...
0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
294 views
$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case, $L(G1) \cap L(G2) = \phi$ is a/an:Decidable prob...
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
202 views
Recursive Enumerable Languages are NOT closed under :UnionIntersectionComplementHomomorphism
0 votes
0 votes
1 answer
4