Problem Detail: I was asked to find the adversary arguments necessary for finding the lower bounds for selection and insertion sort. I could not find a reference to it anywhere. I have some doubts regarding this. I understand that adversary arguments Read More …
Author: ignougroup
How is the rule 110 Turing complete?
Problem Detail: I’ve read the wikipedia page for rule 110 in cellular automata, and I more or less know how they work (a set of rules decides where to draw the next 1 or 0). I’ve just read they’re Turing complete, Read More …
What is the difference between decidability and computability?
Problem Detail: If they are different, what are the typical problems in each that do not fall on the other category? Or are the mutually exclusive or does one completely capture the other? Asked By : sdfasdgasg Answered By : Kaveh A function Read More …
how to draw a complement of a Turing Machine?
Problem Detail: I am now pretty confident on how I would turn something into a Turing Machine. Now my question is how do you convert TM into a complement of a Turing Machine. From what I can remember in Finite Automata, Read More …
What are lattices used for?
Problem Detail: Wikipedia says: Complete lattices appear in many applications in mathematics and computer science Is it just referring to the fact that the standard Boolean algebra used in computation is a complete lattice? Is there anything we gain by working Read More …
Is there an undecidable finite language of finite words?
Problem Detail: Is there a need for $Lsubseteq Sigma^*$ to be infinite to be undecidable? I mean what if we choose a language $L’$ be a bounded finite version of $Lsubseteq Sigma^*$, that is $|L’|leq N$, ($N in mathbb{N}$), with $L’ Read More …
Can input to a Turing machine be of infinite length?
Problem Detail: Considering only the alphabet $Sigma = {0,1}$, the strings which can be given as input to the Turing machines are from the set $Sigma^{*}$. But does it make sense for the input to be an infinite binary string ? Read More …
Prove that regular languages are closed under the cycle operator
Problem Detail: I’ve got in a few days an exam and have problems to solve this task. Let $L$ be a regular language over the alphabet $Sigma$. We have the operation $operatorname{cycle}(L) = { xy mid x,yin Sigma^* text{ and } Read More …
Irregularity of ${a^ib^jc^k mid text{if } i=1 text{ then } j=k }$
Problem Detail: I read on the site on how to use the pumping lemma but still I don’t what is wrong with way I’m using it for proving that the following language is not a regular language: $L = {a^ib^jc^k mid Read More …
Fast k mismatch string matching algorithm
Problem Detail: I am looking for a fast k-mismatch string matching algorithm. Given a pattern string P of length m, and a text string T of length n, I need a fast (linear time) algorithm to find all positions where P Read More …
