Author: ignougroup

Problem Detail: I’ve been trying to wrap my head around Co-NP, and how it’s different to NP, but I am having some trouble. Co-NP is defined by Wikipedia as this: “A decision problem $mathcal{X}$ is a member of co-NP if and Read More …

Problem Detail: I know this is a simple question but can someone show me how $(lambda y. lambda x. lambda y.y) (lambda x. lambda y. y)$ reduces to $lambda x. lambda y. y$. Asked By : prerm2686 Answered By : sepp2k The reason Read More …

Problem Detail: The optimization version of TSP asks for the length of the shortest tour. Unlike the decision version of TSP, there’s no obvious way to verify a proposed solution of the optimization problem in polynomial time. But is there a Read More …

Problem Detail: I have multiples arrays. I’d like to enumerate all sets containing exactly one item from each array in a (pseudo-)random order, without explicitly building the array of all sets. Any solution, even with poor pseudo-randomization, is welcome. EDIT: Example Read More …

Problem Detail: Let $cal{S}={S_i}_{1leq ileq n}$ be a partial $(m,k)$-design and $f: {0,1}^m to {0,1}$ be a Boolean function. The Nisan-Wigderson generator $G_f: {0,1}^l to {0,1}^n$ is defined as follows: $$G_f(x) = (f(x|_{S_1}) , ldots, f(x|_{S_n}) )$$ To compute the $i$th Read More …

Problem Detail: I would like to be able to represent circles in x-y coordinates. Each circle contains an x and y coordinates and radius in double data type. My goal is to compare circles with each other whether they are partially Read More …

Problem Detail: There’s a question on SO asking why in Java the right type doesn’t get picked in a concrete case. I know that Java can’t do it in such “complicated” cases, but I’m asking myself WHY? The (for simplicity slightly Read More …

Problem Detail: A basic instruction cycle consists of these 5 stages. Instruction Cycle IF – Instruction Fetch RD – Instruction Decode and Register Read EX – Execute MA – Memory Access WB – Write Back I understood the function of all Read More …

Problem Detail: In the context of our investigation of heap automata, I would like to prove that a particular variant can not accept non-context-sensitive languages. As we have no equivalent grammar model, I need a proof that uses only automata; therefore, Read More …