Problem Detail: SAT [5] can be solved with resolution definitively, i.e. if the formula has a true assignment, resolution can find it, and if it cant be satisfied, resolution can show that no assignment exists (at least in exponential time/space.). [4] Read More …
Category: Uncategorized
[Solved]: What is the TAK function for?
Problem Detail: We covered this in class today. I understand the mechanics of it, but aside from being a nice example of recursion does it serve any purpose? Searching the web reveals lots of pages with the formula and it’s implementation Read More …
[Solved]: Call by need compared to pass by function
Problem Detail: SML uses pass‑by‑value, Haskell uses call‑by‑need. Unless I’m wrong (the purpose of this question), one can do call‑by‑need with SML, passing a function instead of a value; a function to be later evaluated when needed. Adapting a classical example: Read More …
[Solved]: Regular expression for the language where every a is surrounded by b’s
Problem Detail: I had a question on an assignment where we were supposed to write a regular expression for a language where every $a$ in $w$ is immediately preceded and followed by a $b$. My answer was $epsilon + (b + Read More …
[Solved]: Do Kernel-Mode Windows Services Considered Part of Kernel?
Problem Detail: I learned that there are two types of services in Windows , one called -service- which is in user-mode , other is called -driver service / device driver– which is in kernel-mode. What I wonder is , do kernel-level Read More …
[Solved]: Is the DPLL algorithm complexity in terms of # of clauses or # of variables?
Problem Detail: I’m a bit confused how worst case complexity is estimated for the DPLL algorithm. Is it in terms of number of clauses, number of variables, or something else? Asked By : Rich Answered By : Kyle Jones In the papers I’ve Read More …
[Solved]: Halting problem without input?
Problem Detail: I’m only a layman therefore only discuss stuff naïvely. I read some introductory articles about halting problems with a scenario that if there were such a decider accessible to us, we should be able to solve some unsolved mathematical Read More …
[Solved]: Product of a Transition System and a Finite Automaton
Problem Detail: Dealing with a question that asks me to compute the product of the following transition system and finite automaton. Compute the product between the transition system TS and the finite-word automaton A depicted below. Can’t seem to find a Read More …
[Solved]: Infinite chain of big $O’s$
Problem Detail: First, let me write the definition of big $O$ just to make things explicit. $f(n)in O(g(n))iff exists c, n_0gt 0$ such that $0le f(n)le cg(n), forall nge n_0$ Let’s say we have a finite number of functions: $f_1,f_2,dots f_n$ Read More …
[Solved]: The exact relation between complexity classes and algorithm complexities
Problem Detail: Are all algorithms which have polynomial time complexity belong to P class ? And P class do not have any algorithm which does have not polynomial complexity ? Are all algorithms which have non polynomial complexity belong to NP Read More …
