Author: ignougroup

Problem Detail: Can quantum computer become perfect chess player? Can it determine whether (when both players are perfect) win white or black? (or is it dead heat?) Asked By : porton Answered By : David Richerby I’ve already answered essentially this question, on Read More …

Problem Detail: There is a well known definition of parsimonious reduction. The standard definition of parsimonious reduction is very intuitive. It simply means that the two problem have the same number of solutions, when on input of one of them we Read More …

Problem Detail: So I have this question to prove a statement: $O(n)subsetTheta(n)$… I don’t need to know how to prove it, just that in my mind this makes no sense and I think it should rather be that $Theta(n)subset O(n)$. My Read More …

Problem Detail: I proved by induction that every AVL tree may be colored such that it will be red black tree. The problem is that I can’t see an error in my proof. Look at my proof. Induction for height. Let’s Read More …

Problem Detail: I’ve looked through all the other similar questions, but I don’t feel like I understood exactly what I’m supposed to do with my case, so I’m hoping I’m not the only one. In an exercise I’m doing, I’m told Read More …

Problem Detail: I’m having trouble in comparing these two memory consistency models. Essentially for sequential consistency I think of real code like this: int x, y; void ThreadA() { x = 20; //Write int a = y; //Read } void ThreadB() Read More …

Problem Detail: A lot of activation functions in neural networks (sigmoid, tanh, softmax) are monotonic, continuous and differentiable (except of may be a couple of points, where derivative does not exist). I understand the reason for continuity and differentiability, but can Read More …

Problem Detail: This Wikipedia example is very confusing. Its saying the max flow = min cut. But I see the max flow = 9 and the min cut = 7. If not, how does the capacity =min cut here? Which is Read More …

Problem Detail: I am learning about Greedy Algorithms and we did an example on Huffman codes. To prove the correctness of our algorithm, we had to have the greedy choice property and the optimal substructure property. Here is what my professor Read More …

Problem Detail: I’m attempting to create an automatic scheduler from a list of tasks I have available. Here are the key points: Each task has been given a priority beforehand and the algorithm should try to maximize the total ‘priority points’ Read More …