Problem Detail: In Michael Sipser’s Theory of Computation on page 270 he writes: P = the class of languages for which membership can be decided quickly. NP = the class of languages for which membership can be verified quickly. What is Read More …
Category: Uncategorized
[Solved]: Sampling perfect matching uniformly at random
Problem Detail: Suppose I have a graph $G$ with $M(G)$ the (unknown) set of perfect matchings of $G$. Suppose this set is non-empty, then how difficult is it to sample uniformly at random from $M(G)$? What if I am okay with Read More …
[Solved]: Back invalidation to maintain inclusion in inclusive cache
Problem Detail: For an L2 cache that is strictly inclusive of the L1 cache, if a block to be evicted is also present in L1, then back invalidation is required to maintain the inclusion property. I am interested in some details Read More …
[Solved]: Proper terminology in Prolog/logical programming theory?
Problem Detail: I have a good understanding of how to program using logic languages, but I’m currently writing up a paper describing some of my work, and I wanted to ensure that I wasn’t abusing the proper terminology when describing logic Read More …
[Solved]: what are read/write operations involved in main memory, cache and processor?
Problem Detail: please bear with me, I always get confused with the terminologies used in my computer architecture class. What are read and write operations exactly? What are their relationship with processor, main memory, and cache? I always thought that load/store Read More …
[Solved]: Why are progress bars so inaccurate?
Problem Detail: Computers and programming languages tend to be deterministic and predictable. Yet progress bars seem the opposite, especially if the operation is complex. Even for world class professional products, some progress bars do little to reflect the real progress of Read More …
[Solved]: Can you solve 2-sat problem when truth assignments of some variables are determined
Problem Detail: I am trying to find a assignment to satisfy a 2-sat statement. Problem is some of the clauses are 0 or x or 1 or x. I think the 1 or x clauses have no effect on the solution, Read More …
[Solved]: Why can’t fibers utilize multiple processors?
Problem Detail: It seems that the distinction between fibers and threads is that fibers are cooperatively scheduled, whereas threads are preemptively scheduled. The point of the scheduler seems like a way to make an otherwise serial processor resource act in a Read More …
[Solved]: Is there a repository for the hierarchy of proofs?
Problem Detail: I am self-learning proof assistants and decided to start on some basic proofs and work my way up. Since proofs are based on other proofs and so form a hierarchy, is there a repository of the hierarchy of proofs? Read More …
[Solved]: Is $epsilon$ always contained in $Sigma^*$?
Problem Detail: Please correct me on any terminology. For some reason I’m a bit confused. $Sigma = {epsilon, 0, 1}$ This means my alphabet, $Sigma$, contains three symbols ($epsilon, 0, 1$). $Sigma^*$ is the language over $Sigma$, and it equals ${epsilon, Read More …
