Category: Uncategorized

Problem Detail: I am wanting to try and prove that the English language is not regular. The alphabet is the set of all words in the English dictionary. Looking at sentences, I was able to use this pattern of sentences { Read More …

Problem Detail: I am aware of using Bellman-Ford on a graph $G=(V,E)$ with no negative cycles to find the single-source single-destination shortest paths from source $s$ to target $t$ (both in $V$) using at most $k$ edges. Assuming we have no Read More …

Problem Detail: Reachability is defined as follows: a digraph $G = (V, E)$ and two vertices $v,w in V$. Is there a directed path from $v$ to $w$ in $G$? Is it possible to write a polynomial time algorithm for it? Read More …

Problem Detail: From the book Computer organization and design by Patterson&Hennessy: Parity is a function in which the output depends on the number of 1s in in the input. For an even parity function, the output is 1 if the input Read More …

Problem Detail: Let $$L_ = {langle Mrangle mid M text{ is a Turing Machine that accepts the string 1100}}, .$$ To proof that the language $L$ is undecidable I should reduce something to $L$, right? I tried with the classic $A Read More …

Problem Detail: I’m reading The Art of Multiprocessor Programming and am currently trying to understand Chapter 4 — The Foundations of Shared Memory. In section 4.2 it is shown how to build a multi-reader, single-writer (MRSW) safe Boolean register from a Read More …

Problem Detail: I have two sets B which is recursively enumerable and is not recursive, and A which is recursive. Is $A-B$ recursive and / or recursively enumerable? What about $B-A$? $B-A$ is obviously recursively enumerable (to generate its elements, I Read More …

Problem Detail: I’m trying to figure out if there is a proper or commonly accepted name for this particular function (f). float clamp(float min, float max, float v) { if (v < min) return min; else if (v > max) return Read More …

Problem Detail: I have designed a classifier M which recognizes gestures and classifies it under any category always. A gesture is classified based on the hamming distance between the sample time series y and the training time series x. The result Read More …

Problem Detail: Universal Turing Machine can be boiled down to two components. Infinite tape of input and an action table, a finite state machine that moves read/write head along the tape and writes to it depending on input provided by the Read More …