logo

Question detail

Which statement best describes a non-computable problem?

Try the question, check the answer, then read the explanation to understand the curriculum point.

At a glance

MCQ

Type

practice

Style

Topic

Classification of algorithms

Exam-style question

Try this first

Which statement best describes a non-computable problem?.

  1. A.It is a problem for which no algorithm can provide a solution in every case
  2. B.It is a problem that takes more than one second to solve
  3. C.It is a problem that needs more than one programming language
  4. D.It is a problem with an unusually large data input

Model answer

What a good answer should say

  • It is a problem for which no algorithm can provide a solution in every case

Explanation

Why this works

A non-computable problem cannot be solved algorithmically in every case. Runtime, input size and choice of language do not by themselves determine whether a problem is computable.

Common mistake

No common mistake is linked to this question yet.

Related flashcards

No flashcards are published for this page yet.

Related practice questions

No questions are published for this page yet.