Author: ignougroup

Problem Detail: Let r be the number of rows in a DRAM array, and c be the number of columns. Apparently, DRAM with organization 16×1 requires least pins when r = c = 4 because fewer address bits are required to Read More …

Problem Detail: Suppose I am given an array of $n$ fixed width integers (i.e. they fit in a register of width $w$), $a_1, a_2, dots a_n$. I want to compute the sum $S = a_1 + ldots + a_n$ on a Read More …

Problem Detail: A polynomial-time Turing machine algorithm is considered efficient if its run-time, in the worst-case, is bounded by a polynomial function in the input size. I’m aware of the strong Church-Turing thesis: Any reasonable model of computation can be efficiently Read More …

Problem Detail: Is that statement false or true? I believe it’s false because ln(n) = log base e of n. So therefore, log base 2 of n can be a minimum because in 2^x = n, x will always be less Read More …

Problem Detail: I’m clojure user myself. I’m trying really hard to learn haskell and to better understand the type system. However, I feel that trying to ‘type’ everything is quite restrictive when the problem or the data is less defined. I Read More …

Problem Detail: Consider the language over the alphabet $sum= {a}$ containing strings whose length is either a multiple of 2 or 3 (including the empty strings). Writing a regular expression for this language Asked By : Leroy Kayanda Answered By : Yuval Filmus Read More …

Problem Detail: Doing the following exercise: Let $overline{HALT(x,y)}$ be defined as $overline {HALT(x,y)} iff text{program number y never halts on input x}$ Show that it is not computable. Just want to make sure I have understood the concept correctly. We had Read More …

Problem Detail: I realize non-deterministic pushdown automata can be an improvement over deterministic ones as they can “choose” among several states and there are some context-free languages which cannot be accepted by a deterministic pushdown. Still, I do not understand how Read More …

Problem Detail: Given a Turing machine $M$, we say that $L(M) in P$ if the language decided by the machine can be decided by some machine in polynomial time. We say that $M in P$ if the machine runs in polynomial Read More …

Problem Detail: From the book The Nature of Computation by Moore and Mertens, exercise 8.9: Consider the problem ACYCLIC GRAPH of telling whether a directed graph is acyclic. Show that the problem is in NL, and then show that the problem Read More …