Problem Detail: I am trying to solve this problem and I am really struggling. A monotone boolean formula is a formula in propositional logic where all the literals are positive. For example, $qquad (x_1 lor x_2) land (x_1 lor x_3) land Read More …
Blog
What makes type inference for dependent types undecidable?
Problem Detail: I have seen it mentioned that dependent type systems are not inferable, but are checkable. I was wondering if there is a simple explanation of why that is so, and whether or not there is there a limit of Read More …
Visual programming tools, why don’t they work with the AST directly?
Problem Detail: I’ve found several open source visual programing tools like Blockly and friends, and other projects hosted at Github, but could’t find any that work directly with the abstract syntax tree. Why is that? I’m asking because once I discovered Read More …
What is “memory coalescing”?
Problem Detail: I came to know that the graphic processing unit have something called memory coalescing. On reading on it I was not clear on the topic. Is this any way related to Memory Level Parallelism. I have searched in Google Read More …
Problem understanding DFA & NFA equivalence in Theory of Computation
Problem Detail: Before asking this question,I had gone through Equivalence of NFA and DFA – proof by construction but my question is a bit different from that. I was reading Michael Sipser’s Introduction to Theory of Computation and I came to Read More …
Using base 80 for compressing files
Problem Detail: I want to compress file size through making my own numbering system which is 80-based number, I do really want to know whether this even possible ? I learnt that Hexadecimal uses symbols like A, B, C, D, E, F to represent 10,11,12,13,14,15 — Read More …
How to construct the found path in bidirectional search
Problem Detail: I am trying to implement bidirectional search in a graph. I am using two breadth first searches from the start node and the goal node. The states that have been checked are stored in two hash tables (closed lists). Read More …
Why are functional languages Turing complete?
Problem Detail: Perhaps my limited understanding of the subject is incorrect, but this is what I understand so far: Functional programming is based off of Lambda Calculus, formulated by Alonzo Church. Imperative programming is based off of the Turing machine model, Read More …
Is there an algorithm that provably exists although we don’t know what it is?
Problem Detail: In mathematics, there are many existence proofs that are non-constructive, so we know that a certain object exists although we don’t know how to find it. I am looking for similar results in computer science. In particular: is there Read More …
Difference between memory access and write-back in RISC pipeline
Problem Detail: I’m a little confused about the difference of the memory access and the write-back stage in a RISC pipeline. We learned in class these following assumptions: arithmetic & logic: IF, OF, EX, WB load: IF, OF, EX, MA, WB Read More …
