IgnouGroup Social Campus
Problem Detail: I’m trying to find the time complexity of Monte Carlo Tree Search (MCTS). Googling doesn’t help, so I’m trying to see how far I get calculating it myself. It does four steps for n iterations, or before the time Read More …
Problem Detail: Normal human math notation treats juxtaposition as implied multiplication, e.g., $2x$ means $2$ multiplied by $x$. This does not seem to be a common feature of computer languages, although it was, for example, supposed to be included in the Read More …
Problem Detail: I’ve found an algorithm that acts like a depth first traversal that don’t recognizes nodes that have been visited before. A / B C / D | E If run on this graph, the algorithm will traverse in this Read More …
Problem Detail: It can be shown that the logical preposition [ :- (~A->A)->A ] is a theorem (always true). I want to know if anybody knows a real life description for the preposition above? I mean an expression in computer, economics, 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: 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: 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: 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: 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 am looking for an algorithm to solve the following problem: INPUT: a set of $n$ points in the plane, $(x_1,y_1),…,(x_n,y_n)$. OUTPUT: a set of $n-1$ axis-parallel interior-disjoint squares, such that the boundary of each square contains at least Read More …
