Author: ignougroup

Problem Detail: (For reference, i am using Kevin P Murphy’s Book “Machine Learning: A Probabilistic Perspective” and implementing with MATLAN – without any toolboxes) I have a dataset with 392 samples (rows), each sample has 8 features (columns), one of which Read More …

Problem Detail: As a fun project, I’ve been working on a C# implementation of Richard Korf’s – Finding Optimal Solutions to Rubik’s Cube Using Pattern Databases. https://www.cs.princeton.edu/courses/archive/fall06/cos402/papers/korfrubik.pdf I actually have it working, I’m just trying to improve my solution. One thing Read More …

Problem Detail: I’m trying to use gates that do addition and multiplication modulo 5 to emulate logic gates. Assuming false and true are mapped to 0 and 1 respectively (with 2, 3, and 4 being invalid), I figured out I can Read More …

Problem Detail: Can the set of states Q be empty by definition? I was wondering about this question when doing exercises in the pumping lemma for finite automaton. Asked By : user8272 Answered By : Shaull In a DFA – no, because the Read More …

Problem Detail: Below is a well-known equation for generalized recurrence relation in a divide and conquer paradigm (as described in CLRS) — $$T(n) = aT(n/b) + f(n), quad text{where} quad a gt 1 text{ , } b geq 1$$ If we Read More …

Problem Detail: I went through a question asking me to categorize the following grammar. $$S → AA, S → AB, A → a, A→BB, B → b, B → e$$ From the production rules, clearly it is Context-Free. But it accepts Read More …

Problem Detail: What is the complexity of the follwoing recurrence? $$T(n) = T(n-1) + 1/n$$ I highly suspect the answer to be $O(1)$, because your work reduces by $1$ each time, so by the $n$th time it would be $T(n-n) = Read More …

Problem Detail: The question is pretty much in the title. Is there ever a time where some language $L$ can be accepted by a minimal DFA with $n$ states, but $L^R$, the reversal of $L$, can be accepted by a DFA Read More …

Problem Detail: I want to prove that $E subsetneq EXP$ and i would like to do so using the Time Hierarchy Theorem I need to choose $f(n)$, i think $2^{cn}$ is a good choice, so here is my Proof: $Esubseteq TIME(2^{cn})$ Read More …

Problem Detail: I was solving exercises on Lambda calculus. However, my solutions are different from the answers and I cannot see what is wrong. Find free variables of $(lambda x.xy)x$. My workings: $FV((lambda x.xy)x)=FV(lambda x.xy) cup FV(x)={y} cup {x}={x,y}$. The model Read More …