Answered

Explain the difference between undecidable problems and unreasonable time algorithms. Be specific.

Answer :

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.

Go Question: Other Questions