IgnouGroup Social Campus
Problem Detail: So I’m studying for a midterm and my professor put out a sample exam with the answers, and I’m stuck on one of the questions. The answer is Big-O(n^2 log n) Could someone show me the steps necessary to Read More …
Problem Detail: How to prove that there exist two different programs A and B such that A printing code of B and B printing code of A without giving actual examples of such programs? Asked By : KirillSk Answered By : A.Schulz You Read More …
Problem Detail: Can you give me some suggestions about a good introductory (but comprehensive) bookabout Logic and Computation? Some fuzzy topics that I have in mind are: Presburger artihm., PA, ZF, ZFC, HOL Set theory, Type theory Modeling Computation (Turing machines) Read More …
Problem Detail: I am confused about the statement of the Master theorem in CLRS book. Here is the link of the book CLRS. In page 94, the theorem, in case 2, states that: If $displaystyle f(n)=Theta(n^{log_ba})$, then $T(n) = Theta(n^{log_ba}lg n)$. Read More …
Problem Detail: Will choosing the child of a node randomly in the alpha beta algorithm have a better chance to get a cut off than choosing them in order? Here’s the pseudocode with my addition marked with ***. function alphabeta(node, depth, Read More …
Problem Detail: TL;DR: If you have two entangled qubits in the state $|00rangle + |11rangle$, what is the result of applying the Hadamard gate on the second qubit, and why? I am trying to understand $text{PSPACE} subseteq text{QIP}(3)$ (Watrous, 2003), and Read More …
Problem Detail: Hello I am trying to solve the AlienTiles problem described at alientiles.com using the A* algorithm but I cannot find any good heuristic function so far. In AlienTiles you have a board with $N times N$ tiles, all coloured Read More …
Problem Detail: The ABD algorithm in paper: Sharing Memory Robustly in Message-Passing Systems can emulate single-writer multi-reader atomic registers in message-passing systems, in the presence of processor or link failures. Looking into the details of this algorithm (in Figure 2, page Read More …
Problem Detail: There’s a lot of debate about what exactly the Church-Turing thesis is, but roughly it’s the argument that “undecidable” should be considered equivalent to “undecidable by a universal turing machine.” I’m wondering if there’s an analogous statement for time Read More …
Problem Detail: Given: $T(n) = T(sqrt{n}) + 1$ (base case $T(x) = 1$ for $x<=2$) How do you solve such a recurrence? Asked By : ajmartin Answered By : ajmartin For the recurrence, $$ T(n) = T(sqrt{n}) + 1 $$ Let $n = Read More …
