Problem Detail: Assume I have a list of functions, for example $qquad n^{log log(n)}, 2^n, n!, n^3, n ln n, dots$ How do I sort them asymptotically, i.e. after the relation defined by $qquad f leq_O g iff f in O(g)$, Read More …
Category: Uncategorized
Destination-based vs source-based routing
Problem Detail: I understand that destination-based routing builds the “route” from the destination backwards to the source (e.g. if using a spanning tree, then the tree is routed at the destination). With source-based routing the opposite is true: the route is Read More …
What can Idris not do by giving up Turing completeness?
Problem Detail: I know that Idris has dependent types but isn’t turing complete. What can it not do by giving up Turing completeness, and is this related to having dependent types? I guess this is quite a specific question, but I Read More …
Are all languages in P?
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 …
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 …
Size of address spaces (logical and physical)
Problem Detail: Suppose a system in which addresses (physical and logical) occupy 32 bits, page size is 1024 bytes (210), and physical memory is of size 32MB. How many frames are in physical memory? Is the logical address space larger than Read More …
Undecidable among these for turing machine
Problem Detail: Below are two questions I found in Theory of Computation book but couldn’t find its correct answers, can anyone please give correct answers with explanation? It is undecidable, whether an arbitrary Turing machine(TM) has 15 states an arbitrary TM Read More …
Understand the time complexity for this LCS (longest common subsequence) solution
Problem Detail: I would appreciate an intuitive way to find the time complexity of dynamic programming problems. Can anyone explain me “#subproblems * time/subproblem”? I am not able to grok it. Code for LCS – public static String findLCS(String str1, String Read More …
Why do low fitness individuals have a chance to survive to the next generation?
Problem Detail: I am currently reading and watching about genetic algorithm and I find it very interesting (I haven’t had the chance to study it while I was at the university). I understand that mutations are based on probability (randomness is Read More …
How to find whether a grammar’s language is finite or infinite?
Problem Detail: I have this context-free grammar and I want to find out whether its language is finite or infinite. S -> XY|bb Step 1 X -> XY|SS Step 2 Y -> XY|SS Step 3 So I would do S -> Read More …
