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 …
Category: Uncategorized
[Solved]: How to Prove E $subsetneq$ EXP?
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 …
[Solved]: How do I choose an optimal cell size when searching for close pairs of points, and using cells to implement this?
Problem Detail: Suppose that I have a set of $N$ points in $k$-dimensional space ($k>1$), such as in this question, and that I need to find all pairs with a distance¹ smaller than a certain threshold $t$. The brute-force method would Read More …
[Solved]: Decision problem which belongs to P reduced to a decision problem which belongs to NP?
Problem Detail: Is it possible to have a decision problem $A$ which belongs to P and reduce it to a decision problem $B$ which belongs to NP, i.e. $A leq_{mathrm{p}} B$, where $A$ belongs to P, $B$ belongs to NP? Asked Read More …
[Solved]: I am having trouble understanding (and implementing) logistic regression for classifying into three classes
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 …
[Solved]: Indexing into a pattern database – Korf’s Optimal Rubik’s Cube solution
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 …
[Solved]: What is one method used to prove each palindrome is in its own Myhill-Nerode equivalence class?
Problem Detail: I understand how you can use a contradiction in regard to a DPDA to show a language has finitely many Myhill-Nerode equivalence classes, but what is the method used to show each string of a language accepting palindromes is Read More …
[Solved]: How does the use of oracle Turing machines not lead to contradictions?
Problem Detail: How can we ensure that we are continuing to make sound and valid statements about complexity classes when using oracle Turing Machines? According to my understanding (based on the definitions given in introductory textbooks on the subject) oracle Turing Read More …
[Solved]: Free variables of (λx.xy)x and bound variables of λxy.x
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 …
[Solved]: Realtime hardware/software versus PC software/hardware, how are these distinct and alike?
Problem Detail: This question stems from a few answers and comments on a question I posted in signal processing found here. I guess I am a little confused. Are there any concrete differences between realtime software/hardware and just a regular PC? Read More …