Author: ignougroup

Question Detail: I’ve always thought vaguely that the answer to the above question was affirmative along the following lines. Gödel’s incompleteness theorem and the undecidability of the halting problem both being negative results about decidability and established by diagonal arguments (and Read More …

Question Detail: I’ve just begun this stage 2 Compsci paper on algorithms, and stuff like this is not my strong point. I’ve come across this in my lecture slides. int length = input.length(); for (int i = 0; i < length Read More …

Question Detail: Anyone knows if there is an algorithm for directly write the context-free grammar that generates a given regular expression? Asked By : Marco L. Best Answer from StackOverflow Question Source : http://cs.stackexchange.com/questions/9050 Answered By : Raphael I assume you want to get Read More …

Question Detail: Sometimes it’s easy to identify the time complexity of an algorithm my examining it carefully. Algorithms with two nested loops of $N$ are obviously $N^2$. Algorithms that explore all the possible combinations of $N$ groups of two values are Read More …

Question Detail: Sometimes it’s easy to identify the time complexity of an algorithm my examining it carefully. Algorithms with two nested loops of $N$ are obviously $N^2$. Algorithms that explore all the possible combinations of $N$ groups of two values are Read More …

Question Detail: Anyone knows if there is an algorithm for directly write the context-free grammar that generates a given regular expression? Asked By : Marco L. Best Answer from StackOverflow Question Source : http://cs.stackexchange.com/questions/9050 Answered By : Raphael I assume you want to get Read More …

Question Detail: I’ve just begun this stage 2 Compsci paper on algorithms, and stuff like this is not my strong point. I’ve come across this in my lecture slides. int length = input.length(); for (int i = 0; i < length Read More …

Question Detail: I’ve always thought vaguely that the answer to the above question was affirmative along the following lines. Gödel’s incompleteness theorem and the undecidability of the halting problem both being negative results about decidability and established by diagonal arguments (and Read More …

Question Detail: I have been wondering about this question since I was an undergraduate student. It is a general question but I will elaborate with examples below. I have seen a lot of algorithms – for example, for maximum flow problems, Read More …

Question Detail: I know that there exist a Turing Machine, if a function is computable. Then how to show that the function is not computable or there aren’t any Turing Machine for that. Is there anything like a Pumping lemma? Asked Read More …