Register
Explain the difference between undecidable problems and unreasonable time algorithms. Be specific.
54.1k views
11 votes
Explain the difference between undecidable problems and unreasonable time algorithms. Be specific.

User Thomas Mueller
by
3.5k points

1 Answer

7 votes
One for which no algorithm can ever be written to find the solution is an unsolvable problem. An undecidable problem is one for which no algorithm can ever be written that will always provide any input value with a correct true/false option.
User Donthurtme
by
3.5k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

3.4m questions

4.3m answers

Other Questions

Assume you have created a mechanical arm that can hold a pen. The arm can perform the following tasks: • Lower the pen to a piece of paper. • Raise the pen from the paper. • Move the pen 1 inch along a
What problem does chlorofluorocarbon (CFC) create? a. it causes lead poisoning b.it causes great damage to the ozone layer c. it leaks into food as it cools the air and refrigerators d. it is responsible
Does anyone have game design in connections
What do customers typically notice during virtual interactions?
Bob is stationed as a spy in Cyberia for a week and wants to prove that he is alive every day of this week and has not been captured. He has chosen a secret random number, x, which he memorized and told
Link Copied!