Problem Detail: I’m a bit confused about these concepts. As far as I understand, something is Turing complete when it can simulate a Turing machine. And there is this thing called a Universal Turing machine which is universal because it can Read More …
Category: Uncategorized
Proof that there is unambigous grammar for every regular language
Problem Detail: How can I prove, or where can I find proof that for every regular language there is unambigous grammar? Asked By : Josko Answered By : Patrick87 Something like this might work. First, note that every regular language is accepted by Read More …
Testing Polygon for Monotonicity with respect to any arbitrary line
Problem Detail: Definition: monotone polygon – a polygon $P$ in the plane is called monotone with respect to a straight line $L$, if every line orthogonal to $L$ intersects $P$ at most twice. I am wondering if and how it Read More …
Word classification algorithms
Problem Detail: I am looking for algorithms to classify words in a paragraph of text. I am particularly interested in a classification to determine if a certain word is noun, verb, etc., but also looking for any kind of word-classification algorithms. Read More …
Why do Shaefer’s and Mahaney’s Theorems not imply P = NP?
Problem Detail: I’m sure someone has thought about this before or immediately dismissed it, but why does Schaefer’s dichotomy theory along with Mahaney’s theorem on sparse sets not imply P = NP ? Here’s my reasoning: Create a language $L$ which Read More …
Can somebody explain Horner’s method of evaluating polynomials and how does it reduce the time complexity to 2n operations?
Problem Detail: I have been trying to understand the difference between normal polynomial evaluation and horner’s method. usually it takes 3n-1 operations while horner’s method reduces it to 2n operations. I tried a couple of explanations but they were too theoritical. Read More …
Turing machine and coming up with an idea
Problem Detail: I read many things about the Turing machine and understand how it works but what I can’t get the grasp of (and what none of the books seem to try to teach) is how should I approach a problem Read More …
Determine if this language is regular
Problem Detail: Let $L = {xyx mid text{ for some }x,y in {0,1}^+}$. Is this language regular? So I was trying to construct a DFA, but I don’t how to do this with this language. Asked By : user678392 Answered By : Timot Read More …
How to find the Branch factor of 8 Puzzle
Problem Detail: I would like to know how to find the average branching factor for 8 puzzle.While referring Artificial Intelligence by George F Luger it says that: Suppose,for example we wish to establish the branching factor of the 8-puzzle.We calculate the Read More …
Why is a (collision-less) hashtable lookup really O(1)?
Problem Detail: Disclaimer: I know there are similar sounding questions already here and on Stackoverflow. But they are all about collisions, which is not what I am asking for. My question is: why is collision-less lookup O(1) in the first place? Read More …
