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

there are 63 couples lined up for an egg tossing contest.Each couple will get one egg.There are 12 eggs in a dozen,and eggs come in one dozen cartons.How many c
charlotte has 12 t-shirts. One fourth of her t-shirts are green. How many of Charlotte T-shirts are green
if x is the principle square root of 7, what must be true.
How does Sac Fungi move?
Mendel realized that the principles of probability could be used to (blank) the results of genetic crosses.
what is 39/50 in a percent
The ratio of red collars to black collars sold at one store is 9 to 10. In one month 30 black collars were sold. Is 57 a reasonable number for the total number
if x is the principle square root of 7, what must be true.
How did the Han emperors support Confucianism
Why do most organisms that die not leave a record of their existence