Problem Detail: Background: Some people consider Software Engineering as a branch of Computer Science, while others consider that they are, or should be, separate. The former stance seems to be well presented in written works. On Wikipedia, Software Engineering is classified Read More …
Category: Uncategorized
[Solved]: Minimizing Turing machine-like automaton with no final states
Problem Detail: I have a deterministic finite automaton which behaves mostly like a Turing machine, with following difference (relevant to this question): The tape is initially finite. The automaton can insert and delete cells from the tape. Actions are associated with Read More …
[Solved]: Simple routing table question
Problem Detail: I’m having difficulties understanding the solution to the following question: Consider the following description of a LAN: The main Internet connection is connected to our gateway router. This in turn is part of the backbone network on the 65.21.1.0/24 Read More …
[Solved]: Difference between “information” and “useful information” in algorithmic information theory
Problem Detail: According to Wikipedia: Informally, from the point of view of algorithmic information theory, the information content of a string is equivalent to the length of the shortest possible self-contained representation of that string. What is the analogous informal rigorous Read More …
[Solved]: What is the order of the Pancake graph in Given example & what are the properties of Pancake graph?
Problem Detail: Pancake graph have least diameter & degree (log n/ log log n) pancake Graph with order-2 will be one single line with two nodes, labeled with permutation of node {12, 21}. pancake Graph with order-3 will be one single Read More …
[Solved]: Is determining if there is a prime in an interval known to be in P or NP-complete?
Problem Detail: I saw from this post on stackoverflow that there are some relatively fast algorithms for sieving an interval of numbers to see if there is a prime in that interval. However, does this mean that the overall decision problem Read More …
[Solved]: Algorithm to chase a moving target
Problem Detail: Suppose that we have a black-box $f$ which we can query and reset. When we reset $f$, the state $f_S$ of $f$ is set to an element chosen uniformly at random from the set $${0, 1, …, n – Read More …
[Solved]: Is DTIME(n) = DTIME(2n) true? (unlike Rosenberg’s results)
Problem Detail: I’m reading Homer and Selman’s “Computability and Complexity” book. In some Corollary 5.3 it says: For all ε > 0, DTIME(O(n)) = DTIME( (1+ε) n). Now I’m confused with this corollary and Rosenberg’s result (p87 in the same book): Read More …
[Solved]: Polymorphism and Inductive datatypes
Problem Detail: I’m curious. I’ve been working on this datatype in OCaml: type ‘a exptree = | Epsilon | Delta of ‘a exptree * ‘a exptree | Omicron of ‘a | Iota of ‘a exptree exptree Which can be manipulated using Read More …
[Solved]: Since we need space for recursive calls, is the space complexity of the recursive factorial is n?
Problem Detail: As Wikipedia says, quickSort needs O(log n) extra space when the following conditions are met: In-place partitioning is used. This unstable partition requires O(1) space. After partitioning, the partition with the fewest elements is (recursively) sorted first, requiring at Read More …
