Blog

Question Detail: Does there exist a set of programming language constructs in a programming language in order for it to be considered Turing Complete? From what I can tell from wikipedia, the language needs to support recursion, or, seemingly, must be Read More …

Question Detail: Most of today’s encryption, such as the RSA, relies on the integer factorization, which is not believed to be a NP-hard problem, but it belongs to BQP, which makes it vulnerable to quantum computers. I wonder, why has there Read More …

Question Detail: There are different queues of processes (in an operating system): Job Queue: Each new process goes into the job queue. Processes in the job queue reside on mass storage and await the allocation of main memory. Ready Queue: The Read More …

Question Detail: Let $Sigma={0,1}$. What is the regular expression for the language of all strings with an even number of $0$’s and an even number of $1$’s? If we only require an even number of $0$’s, the language $(1^*)mid(1^*01^*01^*)^*$ works. But Read More …

Question Detail:  Given the algorithm above (taken from the slides (p. 35) of the Coursera course “Algorithms Part I” by Robert Sedgewick and Kevin Wayne), look at the scenario where i is at “X”, the following happens: Scenario: i -> Read More …

Question Detail: Let $Sigma={0,1}$. What is the regular expression for the language of all strings with an even number of $0$’s and an even number of $1$’s? If we only require an even number of $0$’s, the language $(1^*)mid(1^*01^*01^*)^*$ works. But Read More …

Question Detail: Most of today’s encryption, such as the RSA, relies on the integer factorization, which is not believed to be a NP-hard problem, but it belongs to BQP, which makes it vulnerable to quantum computers. I wonder, why has there Read More …