Category: Uncategorized

Problem Detail: I’m trying to understand the difference between LTL and CTL. In particular, i’m trying to understand when a model (a transition system eg. Kripke structure) satisfy a formula. This is my point of view: a model satisfy an LTL Read More …

Problem Detail: PIC16F887 Block Diagram According to the block diagram above, since we already have Program Memory, which may be used to store our program, why should we still need EEPROM? What is it for? Asked By : AlbertK Answered By : frafl Read More …

Problem Detail: Why is $A(L) = {x in L mid x = x^R }$ context-free if $L$ is a regular language? Trying to understand the approach to determining whether a regular language is context-free. Asked By : Iancovici Answered By : Ran G. Read More …

Problem Detail: It is said that “The Turing machine is not intended as practical computing technology, but rather as a hypothetical device representing a computing machine. Turing machines help computer scientists understand the limits of mechanical computation.” [Wikipedia] So on which Read More …

Problem Detail: My setup is something like this: I have a sequence of sets of integers $C_i (1leq ileq n)$, with $|C_i|$ relatively small – on the order of four or five items for all $i$. I want to choose a Read More …

Problem Detail: Some sets of ordered binary trees can be represented as a CFG with rules of the form A -> aBC A -> b Where A,B,C are nonterminals and a and b are terminals representing internal nodes and leaf nodes Read More …

Problem Detail: Wiki (http://en.wikipedia.org/wiki/Sharp-P) says ‘In computational complexity theory, the complexity class #P (pronounced “number P” or, sometimes “sharp P” or “hash P”) is the set of the counting problems associated with the decision problems in the set NP’. Is there Read More …

Problem Detail: what is the complexity of below relation $ T(n) = 2*T(sqrt n) + log n$ and $T(2) = 1$ Is it $Theta (log n * log log n)$ ? Asked By : panthera onca Answered By : Ken P Yes, the Read More …

Problem Detail: Imagine a program, executed by an interpreter to be a Turing Machine. Consider this code: x = read_input print x Does undecidability mean that there may possibly be an input to this program such that the program may never Read More …

Problem Detail: When I work on an algorithm to solve a computing problem, I often experience that speed can be increased by using more memory, and memory usage can be decreased at the price of increased running time, but I can Read More …