Problem Detail: Maybe I am missing something obvious, but can it be that P = co-NP $subsetneq$ NP or vice versa? My feeling is that there must be some theorem that rules out this possibility. Asked By : aelguindy Answered By : Boris Read More …
Category: Uncategorized
[Solved]: Is there any nongeneral CFG parsing algorithm that recognises EPAL?
Problem Detail: EPAL, the language of even palindromes, is defined as the language generated by the following unambiguous context-free grammar: $S rightarrow a a$ $S rightarrow b b$ $S rightarrow a S a$ $S rightarrow b S b$ EPAL is the Read More …
[Solved]: Distinguishing between uppercase and lowercase letters in the “move-to-front” method
Problem Detail: Is it not necessary to encode both the uppercase and lowercase letter while encoding a message with the move-to-front transform? From an old computer science course exam, the problem was to encode Matt_ate_the_mat starting with an empty list. Using Read More …
[Solved]: Amdahl’s Law and Computer Science
Problem Detail: I would like to learn more about Amdahl’s Law and other similar topics. In what branch of computer science would one place Amdahl’s law? Could someone point me to a textbook or further reading (aside from Wikipedia or other Read More …
[Solved]: Are $log_{10}(x)$ and $log_2(x)$ in the same big-O class of functions?
Problem Detail: Are $log_{10}(x)$ and $log_{2}(x)$ in the same big-O class of functions? In other words, can one say that $log_{10}(x)=O(log x)$ and $log_{2}(x)=O(log x)$? Asked By : David Faux Answered By : Dave Clarke Yes. Because they differ only by a constant Read More …
[Solved]: Finding squares touching points
Problem Detail: I am looking for an algorithm to solve the following problem: INPUT: a set of $n$ points in the plane, $(x_1,y_1),…,(x_n,y_n)$. OUTPUT: a set of $n-1$ axis-parallel interior-disjoint squares, such that the boundary of each square contains at least Read More …
[Solved]: Search in a partial ordering defined by tuples of numbers
Problem Detail: This is a graph theory and partial ordering problem. Consider a set of triples {(di,ai,ci)}i=1…N, which specify edges between two nodes A and B, d denotes a departure time, a an arrival time and c a cost. Technically there Read More …
[Solved]: Converting CFG to CNF (context-free grammar to chomsky normal form)
Problem Detail: I’m trying to prove that the following CFG can be converted to a CNF: S->aAB A->aAa A->bb B->a Here below is how i’ve managed so far: Step 1: add a new start state: S0->S S->aAB A->aAa A->bb B->a Step Read More …
[Solved]: Can a functional language be homoiconic?
Problem Detail: According to the wikipedia page on homoiconicity: In a homoiconic language the primary representation of programs is also a data structure in a primitive type of the language itself. I was wondering if the lambda calculus was homoiconic (I Read More …
[Solved]: How to measure processing power of a quantum computer?
Problem Detail: Is there any way to get an equivalent of computing power of quantum computers in terms of computing power of common computers? I mean, how many teraflops (or so) can a quantum computer compute? How can I calculate that Read More …
