Category: Uncategorized

Problem Detail: Is there an algorithm for the following problem: Given a Turing machine $M_1$ that decides a language $L$, Is there a Turing machine $M_2$ deciding $L$ such that $t_2(n) = o(t_1(n))$? The functions $t_1$ and $t_2$ are the worst-case Read More …

Problem Detail: Assume that we want to develop a warehouse management system, which picks up plastic boxes and stacks them on a pallet. A pallet has a maximum of 5 vertical box stacks and the maximum height of a box stack Read More …

Problem Detail: We have a DAG. We have a function on the nodes $Fcolon Vto mathbb N$ (loosely speaking, we number the nodes). We would like to create a new directed graph with these rules: Only nodes with the same number Read More …

Problem Detail: In Type Theory if one allows Type to be a member of itself, it makes the theory inconsistent. I understand it by analogy to Russel’s paradox in Set Theory, but would prefer to see it done in Type Theory. Read More …

Problem Detail: I am kind of unsure about a reduction between two problems. Here are the two problems: PARTITION: Instance: A finite set of n positive integers $S= {a_1,a_2,…a_n}$. Question: Can the set $S$ be partitioned into two subsets $S_1$,$S_2$, s.t. Read More …

Problem Detail: Lets say $G$ is complete undirected graph with a set of edges coloured either black or red. The problem is to find an algorithm answering if it is possible to remove a subset of nodes from $G$ in a Read More …

Problem Detail: In http://cs.stackexchange.com/a/45524/28999, they do a binary search using an oracle for an NP-Complete problem. They show that the original problem can be reduced to that NP-Complete problem, implying that the original problem is in NP. Why is that allowed? Read More …

Problem Detail: I can say that $x * y$ is a problem, but also I can say that $x * y$ is an algorithm for finding the area of rectangle. I been reading Wikipedia about an algorithm and a problem, but Read More …

Problem Detail: Given any infinite regular language $L$, how can I prove that $L$ can be partitioned into 2 disjoint infinite regular languages $L_1, L_2$? That is: $L_1 cup L_2 = L$, $L_1 cap L_2 = varnothing$, and $L_1$ and $L_2$ Read More …