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

A survey was conducted from 1000 people about what they like the most? By looking at graph how many people enjoyed grapes and bananas?
We’re you able to place some events within the periodic table with just a single clue
Giving brainliest for the right answer so pls help me!
George Washington set up a series of....? or traditions that the following presidents would hold to. A. Presidents B. routines C. precedents
Two lines and a ray intersect to form five angles. The angles are numbered in the diagram 1 through 5. If the measure of ∠4 is 55°, what is the measure of ∠2?
An equilateral triangle has a perimeter of 42. What is it's height?
PLLLLLLLLLZZZZZZZZZZ HHHHHEEELLLLLLLPPPPPPP!!!!!!1!!!
How does the role of the government as a business affect its debts
replica car has a similarity ratio of 1:30. replica car has a width of 3.2 inches. find the width of the original car in inches
I already asked this one but i got 24 mins and its multiple choice please help lol