Problem Detail: If there were an algorithm that factored in polynomial time by means of examining each possible factor of a complex number efficiently, could one not also use this algorithm to solve unbounded knapsack problems since two factors can Read More …
Author: ignougroup
[Solved]: Transition systems that satisfy LTL but not CTL, and vice versa
Problem Detail: I am learning about temporal logic and model checking systems. One conceptual exercise that I am struggling with is how to create a transition system which satisfies only one of two given properties, when one is in LTL and Read More …
[Solved]: Is there a formula to state the number of ‘sets’ of ‘ordered sets within ordered groups’?
Problem Detail: I am new to this and an amateur… please help. My Question in practical terms: Given The three following inputs… determine the number of unique group arrangements as an ordered set. INPUT: ‘a’ = Students ‘b’ = Groups ‘c’ Read More …
[Solved]: How can lazy learning systems simultaneously solve multiple problems?
Problem Detail: On the english Wikipedia it says about lazy learning systems: Because the target function is approximated locally for each query to the system, lazy learning systems can simultaneously solve multiple problems […] What does this mean? I can only Read More …
[Solved]: Knight’s tour from all starting positions
Problem Detail: Is it true that for all $ngeq 5$, there is a knight’s tour of an $ntimes n$ chessboard beginning at every square? For example, is it correct, that there is no solution for a $5times5$ board, with start position Read More …
[Solved]: Prove that languages which contain words whose lengths are multiples of a constant are regular
Problem Detail: This is a problem involving the theory of regular languages. I am stuck on this problem and do not know how to solve this type of problem. Prove that the language $B_n = { a^k mid k text{ is Read More …
[Solved]: Can a solvable problem be encoded in a recursively enumerable language?
Problem Detail: Imagine I have a turing machine that can decide on a specific problem using a language. My question is that that problem (that can be decided by a TM M, with language L) can be encoded in a new Read More …
[Solved]: Hardness of mixed 3-SAT and 2-SAT formula
Problem Detail: It is well known that 3-SAT is $sf NP$-complete , but 2-SAT is in $sf P$. Let there be a formula with $n-1$ clauses with 2 literals each and only 1 clause with 3 literals. We can solve this Read More …
[Solved]: What does it mean when a computer runs ‘faster’?
Problem Detail: If you have two computers with only one thread, a and b. And computer a runs twice as fast as computer b. Does this mean that computer a and can do twice as many operations in a given time Read More …
[Solved]: Examples of specialized instructions of assembly language not available in compilers?
Problem Detail: In my CS computer organization textbook, there’s this blurb on the advantage of assembly over a high-level language. Another major advantage of assembly language is the ability to exploit specialized instructions – for example, string copy or pattern-matching instructions. Read More …
