Blog

Problem Detail: I want to implement mutual exclusion for $n$ processes. Critical section code: int turn = 0; /* shared control variable */ Pi: /* i is 0 or 1 */ while (turn != i) ; /* busy wait */ CSi; Read More …

Problem Detail: Solve this problem: “build an infinite binary oscilator” With a Turing Machine we can solve it a=False While True: a=not a print a, then output will be True False True False True False … (for ever) I think an Read More …

Problem Detail: It seems odd to me that the TSP denies the possibility of repeated cities. The goal of this traveling salesman is to go as fast as possible and visit all of the cities, right? So what if it is Read More …

Problem Detail: There seems to be a sense of competition in creating the fastest computer in the world, and I feel like technically you just have to continue increasing the core number to gain more flops, which is exactly what some Read More …

Problem Detail: I found an algorithm for finding the shortest path on grid between selected cell, to all cells on the grid, with $O(KN)$ where $K$ is the number of neighbor cells and $N$ is the number of cells. How ever Read More …

Problem Detail: I’m working on a paper and would like to review the origins of Kleene’s closure. I am unable to find any article of Kleene’s that has the original definition of the Kleene closure. Is there a paper by Kleene Read More …

Problem Detail: I want to create a digital time capsule which will remain unreadable for some period of time and then become readable. I do not want to rely on any outside service to, for instance, keep the key secret and Read More …

Problem Detail: Given a Tree and pointers to two of it’s nodes A and B (a key value of each node is positive). Find an algorithm that sums up all the values on the path between A and B, when preproccessing Read More …

Problem Detail: I am reading Programming Language Pragmatics by Michael Scott. He says that on a first pass, a compiler will break a program into a series of tokens. He says that it will check for malformed tokens, like 123abc or Read More …

Problem Detail: Given a directed graph $G = (V,A)$, a feedback arc set is a set of arcs whose removal leaves an acyclic graph. The problem is to find the minimum cardinality such set. I want to find out about is Read More …