Problem Detail: I read this question somewhere, and could not come up with an efficient answer. A string of some length has beads fixed on it at some given arbitrary distances from each other. There are $k$ different types of beads Read More …
Author: ignougroup
[Solved]: Fundamental Boolean Functions
Problem Detail: I can define any boolean function (I think) using and and not, or using or and not (plus a constant 0 or 1). And I can define or in terms of xor. And then there are nor and nand. Read More …
[Solved]: Is there an always-halting, limited model of computation accepting $R$ but not $RE$?
Problem Detail: So, I know that the halting problem is undecidable for Turing machines. The trick is that TMs can decide recursive languages, and can accept Recursively Enumerable (RE) languages. I’m wondering, is there a more limited model of computation which Read More …
[Solved]: Reducing from Hamiltonian Cycle problem to the Graph Wheel problem cannot be proved vice versa
Problem Detail: I saw a proof by Saeed Amiri, We will add one extra vertex v to the graph G and we make new graph G′, such that v is connected to the all other vertices of G. G has a Read More …
[Solved]: Transforming an arbitrary cover into a vertex cover
Problem Detail: Given is a planar graph $G=(V,E)$ and let $mathcal{G}$ denote its embedding in the plane s.t. each edge has length $1$. I have furthermore a set $C$ of points where each point $c in C$ is contained in $mathcal{G}$. Read More …
[Solved]: How do I apply patch sized features to larger images?
Problem Detail: I’ve been trying to teach myself some machine learning, and I wanted to ask what seems a simple question, but I’ve not been able to find any resources that explain the next step. Let’s say I am doing semi-supervised Read More …
[Solved]: Searching the space of permutations
Problem Detail: I’m given n objects, and a set of n permutations of these n objects (out of n! total permutations). There is a true underlying permutation, which I know is one among the set of n permutations, but I don’t Read More …
[Solved]: How do you prove Sigma Star is regular
Problem Detail: I noticed in another answer on this forum Note that the languages ∅, {ϵ} and Σ* are regular. How do you prove Sigma Star is regular. Asked By : gatech-kid Answered By : David Richerby It’s easy to design a DFA Read More …
[Solved]: Intuition behind F-algebra
Problem Detail: I looked at here for getting an intuition about F-algebra, but I am still left with some questions. Suppose I have a group signature as $Sigma= (* : X times X rightarrow X, thicksim: X rightarrow X , e Read More …
[Solved]: What techniques can I use to hand-write a parser for an ambiguous grammar?
Problem Detail: I’m writing a compiler, and I’ve built a recursive-descent parser to handle the syntax analysis. I’d like to enhance the type system to support functions as a valid variable type, but I’m building a statically typed language, and my Read More …
