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
Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}

The SL 2 languages are speci?ed with a set of 2-factors in Σ 2 (plus some factors in {?}Σ and some factors in Σ{?} distinguishing symbols that may occur at the beginning and en

Can v find the given number is palindrome or not using turing machine

how to prove he extended transition function is derived from part 2 and 3

1. An integer is said to be a “continuous factored” if it can be expresses as a product of two or more continuous integers greater than 1. Example of continuous factored integers


let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start symbol and P={S->Aba, A->BB, B->ab,AB->b} 1.show the derivation sentence for the string ababba 2. find a sentential form


We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also

matlab v matlab