Problem Detail: Disclaimer: I know there are similar sounding questions already here and on Stackoverflow. But they are all about collisions, which is not what I am asking for. My question is: why is collision-less lookup O(1) in the first place? Read More …
Author: ignougroup
Proof of the Stable Matching Problem
Problem Detail: Looking at the document Fundamentals of Computing Series, The Stable Marriage Problem. Theorem 1.2.3 – page 12: In a man-optimal version of stable matching, each woman has worst partner that she can have in any stable matching. Proof: Suppose Read More …
What is the origin of the client server model?
Problem Detail: I was wondering if someone knew the origin of the client server model. Where does the term come from (paper, software application, book)? Asked By : marcmagransdeabril Answered By : Jukka Suomela This is a good question. It appears that the Read More …
Is C actually Turing-complete?
Problem Detail: I was trying to explain to someone that C is Turing-complete, and realized that I don’t actually know if it is, indeed, technically Turing-complete. (C as in the abstract semantics, not as in an actual implementation.) The “obvious” answer Read More …
Trying to understand this Quicksort Correctness proof
Problem Detail: This proof is a proof by induction, and goes as follows: P(n) is the assertion that “Quicksort correctly sorts every input array of length n.” Base case: every input array of length 1 is already sorted (P(1) holds) Inductive Read More …
Does a Universal Turing Machine have more computational power than a non-universal one?
Problem Detail: I’m a bit confused about these concepts. As far as I understand, something is Turing complete when it can simulate a Turing machine. And there is this thing called a Universal Turing machine which is universal because it can Read More …
Is this language LL(1) parseable?
Problem Detail: I tried to find a simple example for a language that is not parseable with an LL(1) parser. I finally found this language. $$L={a^nb^m|n,minmathbb Nland nge m}$$ Is my hypothesis true or is this language parseable with an LL(1) Read More …
Inherent ambiguity of the language $L_2 = {a^nb^mc^m ;|; m,n geq 1}cup {a^nb^nc^m ;|; m,n geq 1}$
Problem Detail: I went through a question asking me to choose the inherently ambiguous language among a set of options. $$L_1 = {a^nb^mc^md^n ;|; m,n geq 1}cup {a^nb^nc^md^m ;|; m,n geq 1}$$ $$and$$ $$L_2 = {a^nb^mc^m ;|; m,n geq 1}cup {a^nb^nc^m Read More …
Where can a student learn image processing?
Problem Detail: I am a student of computer science with interest in image processing. I have learned how to apply a few effects to images like making them grayscale, sketching them out of lines, etc. I would like to learn more Read More …
If a set S is infinite and recognizable, is there an infinite subset of S that is decidable?
Problem Detail: If a set S is infinite and recognizable, how can I prove that, if any, some subsets K is infinite and decidable? how about infinite and recognizable? Asked By : user3277633 Answered By : Luke Mathieson The second question is the Read More …
