Exhaustive search, Theory of Computation

A problem is said to be unsolvable if no algorithm can solve it. The problem is said to be undecidable if it is a decision problem and no algorithm can decide it. It should be noted that an unsolvable problem might be partially solvable by an algorithm that makes a complete search for a solution. In such case the solution is eventually found whenever it is defined, but the search might continue forever whenever the solution is undefined. Similarly, an undecidable problem might also be partially decidable by an algorithm that makes an exhaustive search.

Posted Date: 3/18/2013 1:12:38 AM | Location : United States







Related Discussions:- Exhaustive search, Assignment Help, Ask Question on Exhaustive search, Get Answer, Expert's Help, Exhaustive search Discussions

Write discussion on Exhaustive search
Your posts are moderated
Related Questions
Rubber shortnote

One might assume that non-closure under concatenation would imply non closure under both Kleene- and positive closure, since the concatenation of a language with itself is included



design an automata for strings having exactly four 1''s

how to convert a grammar into GNF


Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.