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 …
Author: ignougroup
[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 …
[Solved]: Did I correctly prune this min-max search tree using alpha-beta pruning?
Problem Detail: I am studying some old past test questions. Is this search tree correctly pruned? Asked By : gbhall Answered By : gbhall I was close. Here’s an answer from my tutor which makes sense: There should be some pruning on Read More …
[Solved]: Period in postulate; what does it mean?
Problem Detail: While I am learning a lot from others here at the Computer Science site, I must admit that I don’t get as much out of some questions and answers since I typically don’t understand the theorems to the level Read More …
[Solved]: Is the problem of evaluating a boolean formula on a given assignment P-complete?
Problem Detail: I know that the CIRCUIT VALUE problem is P-complete. In the CIRCUIT VALUE problem the input is a Boolean circuit together with an input to this circuit, and the answer is the evaluation of the given circuit on the Read More …
[Solved]: What goes wrong with sums of Landau terms?
Problem Detail: I wrote $qquad displaystyle sumlimits_{i=1}^n frac{1}{i} = sumlimits_{i=1}^n cal{O}(1) = cal{O}(n)$ but my friend says this is wrong. From the TCS cheat sheet I know that the sum is also called $H_n$ which has logarithmic growth in $n$. So Read More …
[Solved]: What is the time complexity of checking if a number is prime?
Problem Detail: Could some one please explain how to get the time complexity of checking if a number is prime? I’m really confused as to if it is $O(sqrt{n})$ or $O(n^2)$. I iterate from $i=2$ to $sqrt{n}$ and continuously checking if Read More …
[Solved]: Is finding a solution of a satisfiability problem harder than deciding satisfiability?
Problem Detail: Is the problem of determining whether or not a given Boolean expression is satisfiable computationally distinct from actually finding a solution to the expression? In other words, is there another way of finding that a given expression is satisfiable Read More …
