Category: Uncategorized

Problem Detail: Flow networks are often constructed when one is interested in measuring how resilient a graph is. The idea goes as follows: two vertices are designated as source $(s)$ and sink $(t)$ respectively, to each edge $e$ of the graph Read More …

Problem Detail: I’ve recently read that there were many real numbers that would never be reachable by humanity. The explanation itself says that we can write as many programs as integers which is infinite, but there are infinite real numbers between Read More …

Problem Detail: Let’s say, I have a cache with: 2^32 bytes of memory 2048 blocks (of 16 bytes each) Now I’m trying to figure out how much bits each field will contain. Direct mapped: One block is 16 bytes (16 * Read More …

Problem Detail: My problem. Given $n$, I want to count the number of valid multisets $S$. A multiset $S$ is valid if The sum of the elements of $S$ is $n$, and Every number from $1$ to $n$ can be expressed Read More …

Problem Detail: There is this example of regular expressions: $$(SigmaSigma)^*= {wmid |w|text{ is even}},.$$ From that I understand the empty string is valid as a string of even length. Is this true? Asked By : Brian Answered By : David Richerby A number Read More …

Problem Detail: I want to know how far a type system in a programming language can be beneficial. For example, I know that in a dependently typed programming language, we can create a Vector class incorporating size of the vector in Read More …

Problem Detail: So, I’m trying to conceptualize something: Say we have a weighed graph of size N. A and B are nodes on the graph. You want to find the shortest path from A to B, given a few caveats: movements Read More …

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 …