Category: Uncategorized

Problem Detail: Procedure: Start a secondary TM in parallel with the first, but have the second perform exactly 1 step each 2 steps the first TM performs (i.e. it runs at half speed). If the second machine ever reaches the same Read More …

Problem Detail: In the timepiece (excuse the pun) that is Time, Clocks and the Ordering of Events, Lamport describes the logical clock algorithm as the following: Each process $Pi$ increments $Ci$ between any two successive events. If event a is the Read More …

Problem Detail: Given cartesian coordinates $x$ and $y$ as input, can a neural network output $r$ and $theta$, the equivalent polar coordinates? This would seem to require an approximation of the pythagorean theorem (which requires approximations of $x^2$ and $sqrt{x}$) and Read More …

Problem Detail: Are there any kind of graphs where Bidirectional Dijkstra would expand more than Dijkstra? I tried to come up with an argument like this: Let node $n$ be expanded by Bidirectional Dijkstra. Now there are two possibilites: Node $n$ Read More …

Problem Detail: Given a sequence of $2 leq n leq 50$ numbers $s = (s_1,s_2,…,s_n)$, find a permutation $a = (a_1,a_2,…,a_n)$ of $s$ such that $$sum_{i=1}^{n-1} |a_i – a_{i+1}|$$ is maximized. I found many codes that get “Accepted” in the online Read More …

Problem Detail: Has anyone succeeded in implementing or designing a type-system that combines both type-state (linear types) and effect types (e.g. Koka)? Asked By : Olle Härstedt Answered By : Matija Pretnar Edwin Brady has done some work in that area using dependent Read More …

Problem Detail: Consider a finite state machine as usual, but every transition, it can also update an integer counter by adding or subtracting a number. Say, a transition function of the form $delta(q,a) = (p,k)$ moves to the new state $p$, Read More …

Problem Detail: My intuition is telling me that this is not the case. But I am having trouble formulating a proof for this.How do I prove it ? Asked By : user3714205 Answered By : babou Take the language $L= {a^{2^p}mid pgeq 1}$. Read More …

Problem Detail: A Graph is a well-defined concept in mathematics, computer science and engineering disciplines that depend on them. However, oftentimes a practical implementation of a (directed) graph in a certain domain or application requires that edges don’t merely connect vertices, Read More …