Blog

Problem Detail: In the seminal distributed systems paper The Part Time Parliament (the Paxos protocol), Leslie Lamport names fictional legislators who are involved in the Paxon parliament protocol. According to this writing, he notes that: I gave the Greek legislators the Read More …

Problem Detail: DFA, NFA and epsilon NFA all the three allow us to represent a particular regular language. With any of those representations we can arrive to the same regular expression, then why do we need to study all the three Read More …

Problem Detail: When developing algorithms in quantum computing, I’ve noticed that there are two primary models in which this is done. Some algorithms – such as for the Hamiltonian NAND tree problem (Farhi, Goldstone, Guttman) – work by designing a Hamiltonian Read More …

Problem Detail: I do not have any argument opposing why we need only a single universal class. However why not we have two universal classes, say an Object and an AntiObject Class. In nature and in science we find the concept Read More …

Problem Detail: I came across the following theorem in Sipser’s about incompressible strings. Let $;f$ be some computable function which holds for almost all strings. The for any $b > 0 $, the property $;f$ is false only on finitely many Read More …

Problem Detail: I’m trying to interpolate a logarithmic function but it always reaches a singularity due to $log(0)$ being $-infty$ is there a correct way to interpolate logarithmic functions? (as in correct parameters) What i’m currently going for is $y=a+b log(cx)$ Read More …

Problem Detail: From Wikipedia: The type of computational problem: The most commonly used problems are decision problems. However, complexity classes can be defined based on function problems, counting problems, optimization problems, promise problems, etc. I also saw the definitions of NP-complete, Read More …

Problem Detail: Before I’ll ask my question, let me start with my understanding of the definitions, to prevent myself with further confusion, as well as giving some background. Huffman Code is the binary-code induced from a binary tree, constructed by Huffman’s Read More …

Problem Detail: I have some questions regarding tree search and graph search (Uninformed search) as explained in chapter 3 of the book : http://aima.cs.berkeley.edu/ As I see, the only difference between the two is that the graph search handles loops (avoids Read More …

Problem Detail: There is a well known worst case $O(n)$ selection algorithm to find the $k$’th largest element in an array of integers. It uses a median-of-medians approach to find a good enough pivot, partitions the input array in place and Read More …