Bissoy.com
Doctors Medicines MCQs Q&A

Which among the following is not an example of primitive recursive function?

Which among the following is not an example of primitive recursive function? Correct Answer Ackermann function

A primitive recursive function is one in which the upper bound or the number of iterations to be performed is known. Most computable functions studied in number theory are primitive recursive. These include addition, subtraction, multiplication, etc. Sequential logic, traversal filter, recursive filter, bit manipulation, and data packing are common primitive recursive functions.

Related Questions

For any two languages L1 and L2 such that L1 is context-free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true? I. L̅1 (complement of L1) is recursive II. L̅2 (complement of L2) is recursive III. L̅1 is context-free IV. L̅1 ∪ L2 is recursively enumerable
Assume statements S1 and S2 defined as: S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable. Which of the following is true?
Which of the following statements are TRUE? I. Top-down parsers are equipped to handle left recursive grammar. II. LALR parser is more powerful than an SLR parser. III. Recursive descent parsing is an example of top-down parsing.
In which of the following cases inline functions may not word? i) If the function has static variables. ii) If the function has global and register variables. iii) If the function contains loops iv) If the function is recursive
Which of the following statement(s) is/are FALSE? (i) There exists a recursively enumerable language whose complement is not recursively enumerable. (ii) If a language L is recursive, then its complement is NOT recursive.
Which of the following statements is/are correct? 1. A system is said to be Finite Impulse Response (FIR), if the output samples of the system depend only on the present input and a finite number of past or previous input samples. 2. If the output of a system y(n) depends only on the present input and past inputs, but not on past outputs, then it is called a non-recursive system. 3. If the output of a system y(n) depends only on the present input and past inputs, but not on past outputs, then it is called a recursive system.
Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y̅ reduces to W, and Z reduces to X̅ (reduction means the standard many-one reduction). Which one of the following statements is TRUE?
The following grammar G is left recursive. E → E + T | T T → T * F | F F → (E) | id Which of the following is a correct left-recursive variant of G? E → TE' E' → T + E' 
Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is a context-free language, then, is L̅  also context-free? 3) If L is a regular language, then, is L̅  also regular? 4) If L is a recursive language, then, is L̅  also recursive?