Problems that cannot be solved by any algorithm are called?

Related MCQs

• Can stable marriage cannot be solved using branch and bound algorithm.
• Which of the following problems can’t be solved using recursion?
• Which of the following problems is NOT solved using dynamic programming?
• Which of the following problems should be solved using dynamic programming?
• Which of the following problems can be solved using the longest subsequence problem?
• Problems that can be solved in polynomial time are known as?
•                    is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
• The 0-1 Knapsack problem can be solved using Greedy algorithm.
• Fractional knapsack problem is solved most efficiently by which of the following algorithm?
• Bellmann ford algorithm provides solution for                          problems.