Problem Detail: Are all languages in $mathbf{P}$? Note: The definitions of all the symbols and functions here follow the document [1]. The following is my attempt to answer the question. Assume that we design a special Turing machine $M_1$, no matter Read More …
Author: ignougroup
What is the difference between “strict schedule” and “cascadeless schedule”?
Problem Detail: In database transactions theory, what is the difference between a strict schedule and a schedule that is merely secured against cascade aborts? Could you give an example of a schedule that is secured against cascade aborts but is not Read More …
Can regular languages be Turing complete?
Problem Detail: I was reading about Iota and Jot and found this section confusing: Unlike Iota, where the syntactic tree for a string can branch either on the left or on the right, Jot syntax is uniformly left-branching. As a result, Read More …
Algorithmic intuition for logarithmic complexity
Problem Detail: I believe I have a reasonable grasp of complexities like $mathcal{O}(1)$, $Theta(n)$ and $Theta(n^2)$. In terms of a list, $mathcal{O}(1)$ is a constant lookup, so it’s just getting the head of the list. $Theta(n)$ is where I’d walk the Read More …
How do garbage collectors avoid stack overflow?
Problem Detail: So I was thinking about how garbage collectors work and I thought of an interesting issue. Presumably garbage collectors have to traverse all structures in the same way. They can’t know weather they are traversing a linked list or Read More …
NP completeness proof of a spanning tree problem
Problem Detail: I am looking for some hints in a question asked by my instructor. So I just figured out this decision problem is $sf{NPtext{-}complete}$: In a graph $G$, is there a spanning tree in $G$ that contain an exact set Read More …
Differences between the Actor Model and Communicating Sequential Processes (CSP)
Problem Detail: When we look at the Actor Model and Communicating Sequential Processes we see that they are both trying to do concurrency based on message passing, yet they are distinct. (We see implementations of the CSP Model in go-lang‘s goroutines Read More …
difference between multilayer perceptron and linear regression
Problem Detail: What is the difference between multilayer perceptron and linear regression classifier. I am trying to learn a model with numerical attributes, and predict a numerical value. Thanks Asked By : user20287 Answered By : Peter If you have a neural network Read More …
Why do we believe that PSPACE ≠ EXPTIME?
Problem Detail: I’m having trouble intuitively understanding why PSPACE is generally believed to be different from EXPTIME. If PSPACE is the set of problems solvable in space polynomial in the input size $f(n)$, then how can there be a class of Read More …
does a DFA converted from NFA always contain 2^Q states?
Problem Detail: when converting an NFA to DFA, we create sub-sets of states in the NFA. does it mean that every DFA-converted-from-NFA contain 2^Q states? or if some sub-sets are unreachable then they are not included in it? Asked By : Tom Read More …
