IgnouGroup Social Campus
Problem Detail: This is a graph theory and partial ordering problem. Consider a set of triples {(di,ai,ci)}i=1…N, which specify edges between two nodes A and B, d denotes a departure time, a an arrival time and c a cost. Technically there Read More …
Problem Detail: I’m trying to prove that the following CFG can be converted to a CNF: S->aAB A->aAa A->bb B->a Here below is how i’ve managed so far: Step 1: add a new start state: S0->S S->aAB A->aAa A->bb B->a Step Read More …
Problem Detail: According to the wikipedia page on homoiconicity: In a homoiconic language the primary representation of programs is also a data structure in a primitive type of the language itself. I was wondering if the lambda calculus was homoiconic (I Read More …
Problem Detail: Is there any way to get an equivalent of computing power of quantum computers in terms of computing power of common computers? I mean, how many teraflops (or so) can a quantum computer compute? How can I calculate that Read More …
Problem Detail: I can’t figure out how to swap boxes on a Turing Machine tape. So for example, I have a tape that says a 1 0 1 1 1 0 ^ And I want to move that a over so Read More …
Problem Detail: This grammar is supposed to give priority to multiplication: E -> E + T | T. T -> T * F | F. F -> x. A derivation for “x + x * x” would be (unless I’m wrong): Read More …
Problem Detail: I’ve just now studied about covariance and contravariance in static languages (more specifically C#). This concept is rather clear to me, however I’m in doubt on how this applies to dynamic languages like Python. Since Python is duck typed Read More …
Problem Detail: Consider the following problem. I have a pattern $P$ of length $100$ and a text $T$ of length $n$. I want to find the minimum number of operations to transform $P$ into $T$. The operations are: Insert a single Read More …
Problem Detail: Continuing on the theme from my last question Variable Length Encoding of Integers, I have come up with a simple encoding scheme, but for which an efficient algorithm eludes me. The constraints are simple enough: no (binary representation) number Read More …
Problem Detail: Why does the empty clause is logically equivalent to a contraddiction: $square cup square Longleftrightarrow perp$ and why the empty cube is logically equivalent to a tautology: $square cap square Longleftrightarrow top$ ? Asked By : alessandro Answered By : zarathustra Read More …
