Which of the following set of computable functions are decidable? – McqOptions

MCQOPTIONS

1.	Which of the following set of computable functions are decidable?
A.	The class of computable functions that are constant, and its complement
B.	The class of indices for computable functions that are total
C.	The class of indices for recursively enumerable sets that are cofinite
D.	All of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

Consider three decision problem A, B, C. A is decidable and B is not. Which of the following is a correct option?
Can a Modified PCP problem be reduced to PCP?
State true or false:Statement: The difference between PCP and MPCP is that in MPCP, a solution is required to start with the first string on each list.
Which of the following statements are undecidable?For a given Turing Machine M,
Which of the following is incorrect according to rice theorem?Let S be a set of language hat is non trivial:a) there exists a TM that recognizes the language in Sb) there exists a TM that recognizes the language not in Sc) both (
Fill in the blank with reference to Rice’s theorem.For any non-trivial property of __________ no general or effective method can decide whether an algorithm computes it with that property.a) partial functionsb) piecewise functionsc) both (
According to the rice’s theorem, If P is a non trivial property, Lp is :
CAN_A_MODIFIED_PCP_PROBLEM_BE_REDUCED_TO_PCP??$
Consider_three_decision_problem_A,_B,_C._A_is_decidable_and_B_is_not._Which_of_the_following_is_a_correct_option?$
PCP stands for?