Author: ignougroup

Problem Detail: I understand that a Church numeral $c_n$ looks like $lambda s. lambda z. s$ (… n times …) $s;z$. This means nothing more than “the function $s$ applied $n$ times to the function $z$”. A possible definition of the Read More …

Problem Detail: Being a programmer I appreciate the errors given by a compiler for a programming language and come to rely on the compiler’s error as a safety net. In learning category theory I would like to have some tool that Read More …

Problem Detail: let’s say we have a set of players that we want to match into teams of aproximatly same strength, so that no team is much stronger than another team. Each team consists of two players. One player is taking Read More …

Problem Detail: I want to know if this problem is polynomial-time solvable or not? The problem is: Given a nonnegative integer-valued matrix of size $2times n$ and two nonnegative integer numbers $b<n$ and $c$. The question is: Find a subset of Read More …

Problem Detail: Find whether given statement True or False? Explain. User level threads are transparent to the kernel? My attempt : False. Since, user level threads are managed by a user level library however, they still require a kernel system call Read More …

Problem Detail: Whilst reading up on Xorshift I came across the following (emphases added): The following xorshift+ generator, instead, has 128 bits of state, a maximal period of 2^128 − 1 and passes BigCrush: [snip code] This generator is one of Read More …

Problem Detail: I know that for every $k$-tape DTM that runs in time $O(t(n))$, there exists a 1-tape DTM that runs in $O(t^2(n))$, no matter how large the $k$ (the $k$-part is a formulation from Wikipedia). But what if $k=infty$? If Read More …

Problem Detail: A SkipList provides the same $O(log n)$ bounds for search as a balanced tree with the advantage that rebalancing isn’t necessary. Since the SkipList is constructed using random coin flips, these bounds only hold as long as the structure Read More …

Problem Detail: Is this variant of the subset sum problem easy/known? Given an integer $m$, and a set of positive integers $A = {x_1, x_2, …, x_n}$ such that every $x_i$ has at most $k=2$ bits set to $1$ ($x_i = Read More …

Problem Detail: An independent set $I$ is a subset of the nodes of a graph $G$ where: no 2 nodes in $I$ are adjacent in $G$. For natural number $k$, the problem $k-text{IND}$ asks if there is an independent set of Read More …