Blog

Problem Detail: Given – A center(lat=x,lng=y) ‘C’ from which a delivery boy makes a round trip. A delivery boy has a bag which may contain at the most 10 boxes to deliver. A set of points Di (lat=xi,lng=yi) around ‘C’ where Read More …

Problem Detail: Suppose we’re receiving numbers in a stream. After each number is received, a weighted sum of the last $N$ numbers needs to be calculated, where the weights are always the same, but arbitrary. How efficiently can this done if Read More …

Problem Detail: I was watching the lecture by Jim Weirich, titled ‘Adventures in Functional Programming‘. In this lecture, he introduces the concept of Y-combinators, which essentially finds the fixed point for higher order functions. One of the motivations, as he mentions Read More …

Problem Detail: I’m reading a paper that refers to the limit as n goes to infinity of Rényi entropy. It defines it as ${{H}_{n}}left( X right)=dfrac{1}{1-n} log_2 left( sumlimits_{i=1}^{N}{p_{i}^{n}} right)$. It then says that the limit as $nto infty $ is Read More …

Problem Detail: Based on the Wikipedia page for a formal system, will all programming languages be contained within the following rules? A finite set of of symbols. (This seems obvious since the computer is a discrete machine with finite memory and Read More …

Problem Detail: I have a problem which essentially reduces to this: You have a black-box function that accepts inputs of length $n$. You can measure the amount of time the function takes to return the answer, but you can’t see exactly Read More …

Problem Detail: I am having a problem trying to solve a question on a past paper asking to design a security lattice. Here is the question: The AB model (Almost Biba) is a model for expressing integrity policies rather than confidentiality. Read More …

Problem Detail: Forgive my ignorance, but I am very new to the publishing process in Computer Science. I have some research that I have done involving analyzing data formats used in web-based image processing applications being presented in various IEEE papers. Read More …

Problem Detail: I have a faint notion of what NP hard is (that a problem is legit difficult 3 SAT for example). I have forgotten what coNP hard, and Wikipedia tells me that the complement of coNP hard is NP hard…not Read More …

Problem Detail:  Does there exist a Turing machine that halts on all inputs but that property is not provable for some reason? I am wondering if this question has been studied. Note, “unprovable” could mean a “limited” proof system (which Read More …