Author: ignougroup

Problem Detail: An algorithm in Artificial Intelligence: A Modern Approach for planning in stochastic, fully observable environments is called And-Or-Graph-Search, implying that it’s a search algorithm. However, I don’t see how it is one. Wikipedia defines search algorithms as, “an algorithm Read More …

Problem Detail: Suppose I give you an undirected graph with weighted edges, and tell you that each node corresponds to a point in 3d space. Whenever there’s an edge between two nodes, the weight of the edge is the distance between Read More …

Problem Detail: We know that the $polyL$-hierarchy doesn’t have complete problems, as it would conflict with the space hierarchy theorem. But: Are there complete problems for each level of this hierarchy? To be precise: Does the class $DSPACE(log(n)^k)$ have complete problems Read More …

Problem Detail: A multiplication table is symmetric over a diagonal, so only about $n^2/2$ of the elements in an $n times n$ multiplication table contain unique information. Same goes for addition tables. In fact, the same is true for any table Read More …

Problem Detail: I’m reading through the HoTT book and I have a hard time with path induction. When I look at the type in the section 1.12.1: $$text{ind}_{=_A}:prod_{C:prodlimits_{x,y:A}(x=_Ay)to mathcal{U}} left( left(prod_{x:A}C(x,x,text{refl}_x)right) to prod_{x,y:A}prod_{p:x=_Ay} C(x,y,p) right),$$ I have no issue understanding what Read More …

Problem Detail: Assume the halting problem was decidable. Is then every recursively enumerable languagerecursive? Asked By : umang Answered By : Peter While we know for sure that the halting problem is (and always will be) undecidable by a Turing machine, we can Read More …

Problem Detail: Reducing one computable problem to another by providing an algorithm which transforms an instance of one problem to one of the other (and limiting the time or space of that algorithm) is clear to me. However, I fail to Read More …

Problem Detail: There are many solutions on the web showing that the subset-sum problem is polynomial time reducible to the set-partition problem. However, during my search, I came across the following powerpoint presentation (slide 12), where it says that the inverse Read More …

Problem Detail: Given two sets of vertices $U$ (size $n$) and $V$ (size $m$), how many possibilities of set of edges $E$ exist that make the bipartite graph $G = (U, V, E)$ connected? Obviously there are $2^{n m}$ different set Read More …