Problem Detail: I was going through the discussion on the question How to define quantum-turing-machines? and I feel that quantum TM and nondetermistic TM are one and the same. The answers to the other question do not touch on that. Are Read More …
Category: Uncategorized
Could the Halting Problem be “resolved” by escaping to a higher-level description of computation?
Problem Detail: I’ve recently heard an interesting analogy which states that Turing’s proof of the undecidability of the halting problem is very similar to Russell’s barber paradox. So I got to wonder: mathematicians did eventually manage to make set theory consistent Read More …
Perfect matching in a graph and complete matching in bipartite graph
Problem Detail: When I google for complete matching, first link points to perfect matching on wolfram. It defines perfect matching as follows: A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of Read More …
CPU frequency per year
Problem Detail: I know that since ~2004, Moore’s law stopped working for CPU clock speed. I’m looking for a graph showing this, but am unable to find it: most charts out there show the transistor count or the capacity per year. Read More …
Understanding an algorithm for the gas station problem
Problem Detail: In the gas station problem we are given $n$ cities ${ 0, ldots, n-1 }$ and roads between them. Each road has length and each city defines price of the fuel. One unit of road costs one unit of Read More …
What is meant by “solvable by non deterministic algorithm in polynomial time”
Problem Detail: In many textbooks NP problems are defined as: Set of all decision problems solvable by non deterministic algorithms in polynomial time I couldn’t understand the part “solvable by non deterministic algorithms”. Could anyone please explain that? Asked By : user5507 Read More …
Data compression using prime numbers
Problem Detail: I have recently stumbled upon the following interesting article which claims to efficiently compress random data sets by always more than 50%, regardless of the type and format of the data. Basically it uses prime numbers to uniquely construct Read More …
Relation between simple and regular grammars
Problem Detail: I am reading “An Introduction to Formal Languages and Automata” written by Peter Linz and after reading the first five chapters I face below problem with simple and regular (especially right linear) grammars which are very similar to each Read More …
Range update + range query with binary indexed trees
Problem Detail: I am trying to understand how binary indexed trees (fenwick trees) can be modified to handle both range queries and range updates. I found the following sources: http://kartikkukreja.wordpress.com/2013/12/02/range-updates-with-bit-fenwick-tree/ http://programmingcontests.quora.com/Tutorial-Range-Updates-in-Fenwick-Tree http://apps.topcoder.com/forums/?module=Thread&threadID=756271&start=0&mc=4#1579597 But even after reading through all of them I Read More …
Finite state automata, multiple completion states?
Problem Detail: I’m currently studying for an exam for a course where some of the material covered included finite state automata, I’ve completed a question and I’m not sure about my answer. Question http://i.stack.imgur.com/vDFax.png My Answer http://i.stack.imgur.com/rSnEv.png Are multiple completion states Read More …
