iduncan664 iduncan664
  • 15-02-2021
  • Computers and Technology
contestada

explain the difference between undecidable problems and unreasonable time algorithms.

Respuesta :

izahyaroseman915
izahyaroseman915 izahyaroseman915
  • 15-02-2021

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.

Explanation:

i hope this help you have a bless day :)

Answer Link

Otras preguntas

6. "Victoria beams like a ray of sunshine" is a metaphor in the active voice. (Points : 2) True False Question 7. 7. Hating someone you are in lov
rephrase the law of conservation of mass in your own words
If the slope of a line on a distance-time graph is 1, the speed of the object being plotted is
50% of all the cakes Jenny baked that week were party cakes, 1/5 were fruit cakes,and the remainder were sponge cakes.What percentage of cakes were sponge cakes
what do 10 fraction 11 plus 7 fraction 9
The diameter of a volleyball is 8.15 inches. What is the volume of the ball, rounded to the nearest hundredth?
sqr of 10(-3sqr 2-2sqr 5)
Rewrite 71/9 as a mixed number.
What is the square root of 289
In the Iliad, which best describes the point at which Achilles enters the battle to avenge the death of Patroclus? A. It is the conflict in the story. B. It is