Author: ignougroup

Problem Detail: How can one calculate the winding number of a polygon given as a list of vertices in some (counter-clockwise or clockwise) order? The complexity of the algorithm must be linear time. Asked By : Dib Answered By : ZeroUltimax The winding Read More …

Problem Detail: Earlier I asked the question: Can a Turing Machine decide if an NFA accepts a string of prime length?. The answer introduced me to Parikh’s theorem, which I’ve been reading about. The concept of Parikh’s theorem, if we apply Read More …

Problem Detail: Could anyone please explain Cantor’s diagonalization principle in simple terms? Asked By : user5507 Answered By : William Macrae Here’s the standard application explained in the simplest terms I can: Theorem: There are more real numbers than there are integers. Lemma: Read More …

Problem Detail: When dealing with the analysis of time and space complexity of algorithms, is it safe to assume that any function which has tight bounds ( i.e. $f(n)=Theta(g(n))$ is asymptotically positive and asymptotically monotonically increasing. I mean that for all Read More …

Problem Detail: An hypervisor (1st type) is a software that creates and run virtual machines, managing guest’s operative systems’s requests to the hardware. An exokernel is an operative system kernel, that let’s programs access directly to the hardware or, with the Read More …

Problem Detail: I am almost totally uneducated in programming and computer science in general, though I am really fascinated by these topics. I read that mathematics is important in programming and that nowadays many mathematicians specialise in applied mathematics in this Read More …

Problem Detail: Lets take POSIX, whats the difference between POSIX API, libc and actual system calls? Asked By : BalaK Answered By : azam I’ll start with system call. a system call is how a program requests a service from an operating system’s Read More …

Problem Detail: When I see a problem like “Write a grammar for a language $L$ if $L = {..}$” for me is a matter of “instinct” the way that one can define productions. For example given the following exercise: Let $L$ Read More …

Problem Detail: Given a language $ L= {a^n b^n c^n}$, how can I say directly, without looking at production rules, that this language is not regular? I could use pumping lemma but some guys are saying just looking at the grammar Read More …

Problem Detail: I have a problem that can be reduced to an assignment problem. (In a previous question i found out how to do that.) Which means we have a set $A$ of agents and a set $T$ of tasks as Read More …