Category: Uncategorized

Problem Detail: A microkernel implements all drivers as user-space programs, and implements core features like IPC in the kernel itself. A monolithic kernel, however, implements the drivers as a part of the kernel (e.g. runs in kernel mode). I have read Read More …

Problem Detail: Most tutorials on Lambda Calculus provide example where Positive Integers and Booleans can be represented by Functions. What about -1 and i? Asked By : zcaudate Answered By : Andrej Bauer First encode natural numbers and pairs, as described by jmad. Read More …

Problem Detail: While doing the second code kata (which asks you to implement a binary search algorithm five times, each time with a different method), I’ve come up with a slightly different solution which works as follows: If i have a Read More …

Problem Detail: I have read the Wikipedia article on Recursively Enumerable languages. The article suggests that the halting problem is recursively enumerable but undecidable. My idea till today was that the halting problem belongs to a class of languages which are Read More …

Problem Detail: I urgently need a language which can be recognised by 2 PDA’s but not with 1 PDA. Asked By : nurgasemetey Answered By : Hendrik Jan A machine using two pushdowns accepts the recursively enumerable languages. So there is a lot Read More …

Problem Detail: You can modify any graph $G$ so that Dijkstra’s finds the solution with the minimal number of edges thusly: Multiply every edge weight with a number $a$, then add $1$ to the weight to penalize each additional edge in Read More …

Problem Detail: I’m working on a parser for a C-style language, and for that parser I need the regular expression that matches C-style /**/ comments. Now, I’ve found this expression on the web: /*([^*]**+[^*/])*([^*]**+|[^*]**/ However, as you can see, this is Read More …

Problem Detail: The discrete logarithm is the same as finding $b$ in $a^b=c bmod N$, given $a$, $c$, and $N$. I wonder what complexity groups (e.g. for classical and quantum computers) this is in, and what approaches (i.e. algorithms) are the Read More …

Problem Detail: What follows is my algorithm for doing this in what I believe to be $O(n)$ time, and my proof for that. My professor disagrees that it runs in $O(n)$ and instead thinks that it runs in $Omega(n^2)$ time. Any Read More …