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
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

constract context free g ={ a^n b^m : m,n >=0 and n


The k-local Myhill graphs provide an easy means to generalize the suffix substitution closure property for the strictly k-local languages. Lemma (k-Local Suffix Substitution Clo



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


We represented SLk automata as Myhill graphs, directed graphs in which the nodes were labeled with (k-1)-factors of alphabet symbols (along with a node labeled ‘?' and one labeled

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