computability problem
nounUK /kəmˌpjuːtəˈbɪləti ˈprɒbləm/
US /kəmˌpjuːtəˈbɪləti ˈprɑːbləm/
A computability problem is a question about whether a computer can solve something by following steps.
The teacher explained that the halting problem is a famous computability problem.
OTHER MEANINGS
2. A task in computer science that asks if a method exists to always get a correct yes-or-no answer.
Researchers studied the computability problem to see if the puzzle could be solved by any program.
3. A difficulty in logic about which functions a machine can calculate.
His homework included a computability problem about adding numbers with a simple machine.
4. A question about the limits of what computers can do.
The class discussed a computability problem involving sorting lists automatically.