Category: Uncategorized

Problem Detail: I’m curious about two things. When we define the class called “probabilistic polynomial-time algorithm” in computer science, does it include polynomial-time algorithm with exponential space? For example, when algorithm is considered to be given a input from domain ${0,1}^n$, Read More …

Problem Detail: Let $a_{1} , … , a_{m} $ be real numbers $geq 1$, where $m$ is at least 1. I am supposed to store them in an augmented AVL structure with the following operations: -PartialSum (i): Return the $i_{th}$ partial Read More …

Problem Detail: I’m currently working on a reduction from $A_{TM}$ to another language, and have been reading through some example proofs. I’ve come across the situation where, for example, we have $L = { langle M,w rangle | text{ …etc} }$, Read More …

Problem Detail: Let $f$ be a fixed time-constructable function. The classical universal simulation result for TMs (Hennie and Stearns, 1966) states that there is a two-tape TM $U$ such that given the description of a TM $langle M rangle$, and an Read More …

Problem Detail: I have a distance to get to, and square tiles that have a cost and length. EX: a 1 unit block that costs 1 unit to purchase. So if I was trying to get 10 units away. I would Read More …

Problem Detail: In long-multiplication, you shift and add, once for each $1$ bit in the lower number. Let $r = p otimes q$ be an operation similar to multiplication, but slightly simpler: when expressed via long-multiplication, the addition does not carry. Read More …

Problem Detail: In practice I understand that any recursion can be written as a loop (and vice versa(?)) and if we measure with actual computers we find that loops are faster than recursion for the same problem. But is there any Read More …

Problem Detail: If I have this pseudocode: for i=0 to n/2 do for j=0 to n/2 do … do anything …. The number of iterations is $n^2/4$. What is the complexity of this program? Is it $O(n^2)$? What is the intuition Read More …

Problem Detail: In a video discussing the merits of particle filters for localization, it was implied that there is some ambiguity about the complexity cost of particle filter implementations. Is this correct? Could someone explain this? Asked By : DorkRawk Answered By Read More …

Problem Detail: Given that Let S = {a | |a| is odd}. I know that since S is decidable, but does there exist a subset within S that is undecidable? Asked By : user3277633 Answered By : Yuval Filmus Hint: For every language Read More …