Register
Explain the difference between undecidable problems and unreasonable time algorithms. Be specific.
54.1k views
11 votes
Explain the difference between undecidable problems and unreasonable time algorithms. Be specific.

User Thomas Mueller
by
8.8k points

1 Answer

7 votes
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.
User Donthurtme
by
8.6k points
← Prev Question Next Question →

Related questions

Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.5m questions

12.2m answers

Other Questions

“What does it mean when we “rework” copyrighted material?”
The book shows how to add and subtract binary and decimal numbers. However, other numbering systems are also very popular when dealing with computers. The octal (base 8) numbering system is one of these.
Seven basic internal components found in a computer tower
Please help me ! All you do is just put it it all in your own words ! Please this is for my reported card!i don't know how to put it in my own words because my English is not that good!
describe an advance in technology that makes life more enjoyable. what discoveries contribute to this technology?
Link Copied!