A problem whose language is recursive is called? , ISRO 2011

2011

A problem whose language is recursive is called? , ISRO 2011

Answer: D. Decidable — In computability theory, a recursive language is one for which there exists a Turing machine that halts on all inputs. This property defines a decidable…

  1. A.

    Unified problem

  2. B.

    Boolean function

  3. C.

    Recursive problem

  4. D.

    Decidable

Attempted by 207 students.

Show answer & explanation

Correct answer: D

In computability theory, a recursive language is one for which there exists a Turing machine that halts on all inputs. This property defines a decidable problem. Therefore, a problem whose language is recursive is called Decidable.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…