Question

Problems that are undecidable and algorithms that are unreasonable both touch on the limits of the kinds of computing
that a computer can accomplish. In your own words, explain the difference between undecidable problems and
unreasonable time algorithms.

Answer 1

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.

Answer 2

Undecidable problems simply describes problems which do not have the algorithm to produce the required 'yes' or 'no' solution while unreasonable time algorithm are those problems which run time grows exponentially.

• A problem is tagged as Undecidable if no algorithm exists to allow such problem produce a 'yes' or 'no' solution. Hence, undecidable problems would sometimes run infinitely or give a wrong output in some cases.

• Unreasonable time algorithm describes problems whose run time increases in an exponential nature. Such programs increases in run time very quickly due to the nature of the of the computation. Example ; 10^n.., where n is a range of values.

Therefore, both undecided and unreasonable time algorithm affects the limits of computing attainable by different computer systems.

Learn more :https://brainly.com/question/21242780?referrer=searchResults