Problem Detail: Amortized accounting method has to be one of the most abstract analysis technique I have ever seen in my life (maybe aside from the potential method which I haven’t read). In the example of the Stack with Multiple Pops Read More …
Category: Uncategorized
[Solved]: Can an interrupt handler be preempted?
Problem Detail: Can a running interrupt handler be pre-empted by another interrupt handler? If this is possible, in which scenarios is this safe, and in which scenarios is it not? If this is not possible, why? Asked By : sanatana Answered By Read More …
[Solved]: Is $L_{half} = {w : text{for some } z in L, x in Sigma^*, z = wx wedge |w| = |x| } $ regular?
Problem Detail: Suppose we have some regular language $L$, then can we say that $$L_{half} = {w : text{for some } z in L, x in Sigma^*, z = wx wedge |w| = |x| } $$ is also regular? I have Read More …
[Solved]: Maximum Spanning Tree vs Maximum Product Spanning Tree
Problem Detail: So I’m kind of wondering if I’m correct on something relating to an algorithms class. Let’s say I want to, for whatever reason, find the maximum spanning tree of a graph such that the edge weight is at maximum Read More …
[Solved]: Proving the set of finite languages is countable without using the union of countable sets
Problem Detail: The list of finite languages over a finite alphabet is countable. I could prove it by saying that the list of languages of size 1 is countable, the language of size 2 is countable, and so on. Then I Read More …
[Solved]: Complexity of taking mod
Problem Detail: This seems like a question that should have an easy answer, but I don’t have a definitive one: If I have two $n$ bit numbers $a, p$, what is the complexity of computing $abmod p$ ? Merely dividing $a$ Read More …
[Solved]: Combinational Logic – Need help with proof by rewrite
Problem Detail: In my Computer Logic class we were assigned the following problem: Complete a truth table that has $3$ inputs $(A, B,C)$ and one output $(F)$. $F$ is asserted whenever $B$ or $C$ are asserted, but deasserted if both $B$ Read More …
[Solved]: Is the language TMs that accept finite languages Turing-recognizable?
Problem Detail: I know that $L={ langle M rangle mid |L(M)| < infty }$ is not decidable (by Rice’s theorem or using reduction, I followed it from $L$ not being decidable ). But is $L$ recognizable? What I tried is, let Read More …
[Solved]: Multisets of a given set
Problem Detail: A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it counting repetitions. (a) What is the number of multisets of size Read More …
[Solved]: Rational agent question from Russell and Norvig
Problem Detail: Question from Artificial Intelligenge: A Modern Approach by Russell and Norvig (Exercise 2.1). Suppose that the performance measure is concerned with just the first $T$ time steps of the environment and ignores everything thereafter. Show that a rational agent’s Read More …
