106k views
20 votes
Explain the difference between undecidable problems and unreasonable time algorithms.

1 Answer

4 votes

Answer:

An unsolvable problem is one for which no algorithm can ever be written to find the solution. An undecidable problem is one for which no algorithm can ever be written that will always give a correct true/false decision for every input value.

Step-by-step explanation:

i hope this help you have a bless day :)

User Vinod R
by
5.9k points