Category: Uncategorized

Problem Detail: There seems to be a sense of competition in creating the fastest computer in the world, and I feel like technically you just have to continue increasing the core number to gain more flops, which is exactly what some Read More …

Problem Detail: It seems odd to me that the TSP denies the possibility of repeated cities. The goal of this traveling salesman is to go as fast as possible and visit all of the cities, right? So what if it is Read More …

Problem Detail: Im sorry if this question has some trivial answer which I am missing. Whenever I study some problem which has been proven undecidable, I observe that the proof relies on a reduction to another problem which has been proven Read More …

Problem Detail: When minimizing the full adder, I don’t understand why $A(bar{B}bar{C} + BC)$ reduces to $Aoverline{(Boplus{C})}.$ $(bar{B}bar{C} + BC)to (Boplus{C})$ is partially decipherable, but why is $(Boplus{C})$ inverted to $overline{(Boplus{C})}?$ Full adder simplification: $ bar{A}bar{B}C + bar{A}Bbar{C} + Abar{B}bar{C} + Read More …

Problem Detail: I have had problems accepting the complexity theoretic view of “efficiently solved by parallel algorithm” which is given by the class NC: NC is the class of problems that can be solved by a parallel algorithm in time $O(log^cn)$ Read More …

Problem Detail: I am new to CFG’s, Can someone give me tips in creating CFG that generates some language For example $L ={ w v w^R mid v,win {a,b}^*wedge|v| text{ is even } }$, where $w^R$ is the reverse of string Read More …

Problem Detail: Given a directed graph $G = (V,A)$, a feedback arc set is a set of arcs whose removal leaves an acyclic graph. The problem is to find the minimum cardinality such set. I want to find out about is Read More …

Problem Detail: I am reading Programming Language Pragmatics by Michael Scott. He says that on a first pass, a compiler will break a program into a series of tokens. He says that it will check for malformed tokens, like 123abc or Read More …

Problem Detail: Given a Tree and pointers to two of it’s nodes A and B (a key value of each node is positive). Find an algorithm that sums up all the values on the path between A and B, when preproccessing Read More …

Problem Detail: Is the language $$L = {a,b}^* setminus {(a^nb^n)^nmid n geq1 }$$ context-free? I believe that the answer is that it is not a CFL, but I can’t prove it by Ogden’s lemma or Pumping lemma. Asked By : Andrés Felipe Read More …