instruction
stringlengths
35
11.4k
Given a matrix $A \in \mathbb{R}^{m \times n}$ that describes a zero-sum game. What are necessary and sufficient conditions for cases in which the k-th pure strategy of the row-player and the l-th pure strategy of the column-player are simultaneously optimal. If I understood the definition of a saddle point correctly, ...
In a public transportation network each stop has an assigned zone. The price of a trip depends on the number of adjacent zones that the user touches during a given trip. If the user touches two adjacent zones it must pay a Z2 title, and it can travel with that title during 1 hour. The time to travel (and price) increas...
I often read in Complexity literature that NP∩coNP is unlikely to have any complete problems. Is that unlikelihood "proved" ? By proved, I mean that there would be a theorem that would relate the existence of such a problem to, by instance, the collapse of PH, or any other equality that is strongly believed not to hold...
CLRS explains B tree key deletion as follows: If the key $k$ is in node $x$ and $x$ is a leaf, delete the key $k$ from $x$. If the key $k$ is in node $x$ and $x$ is an internal node, do the following: a. If the child $y$ that precedes $k$ in node $x$ has at least $t$ keys, then find the predecessor $k'$ of $k$ in the...
How to present (code into) an expression consisting of brackets and following operations: +, -, / and * into a binary tree. Then, I need to write an algorithm that will derive that very tree. Any hints or suggestions on how to do this? I've tried placing brackets and operands into the leaves, but I'm not even precisely...
so the book that I'm reading says this is a deterministic context free language $L = \{a^n b^n | n>0 \}$ $\cup$ $\{ a^n b^{2n} | n < 100 \}$ But i think this is wrong Because : at the beginning of building the DPDA, we have to decide whether we should go with the first one or the second, and considering both of them...
Let's say that $N$ is the number of vertices. We want to create a graph where only two vertices have the same degree. For what kind of $N$ is this possible? I tried it and I've been able only to come up with such where $N$ is $3$ and $4$.
Is fuzzy logic in any way applicable to general-purpose language design? If yes, then how would a computer language theoretically benefit from first order support of fuzzy logic?
What's the running time of: foo(n) if(n==1) return; int i=1; while(i<n) { i=i+2 } foo(n-2) There are $n/2$ recursive calls to foo but how to add to the calculation the while loop
If we consider a machine that uses 64 bits to represent a number. If 1 bit is used for sign, "x" bits to represent mantissa and (63-x) to store the (biased) exponent in a manner similar to the IEEE representation. I'm using this question to check my knowledge of IEEE. Can we say the largest positive number using this m...
Page 854 of The Nature of Computation states the following (This discussion has made the simplifying assumption that $M/r$ is an integer): If each of the observations gives us a random harmonic, how long does it take to learn the fundamental frequency? Suppose we observe the frequencies $k_1 = b_1 M/r$, $k_2 = b_2 M/r...
I first learned big-Oh (little-Oh, big-Theta.....) complexity for growth of functions using CLRS in a computer science class. Now I am doing a project on optimization. In our optimization class, we were introduced to the notion of rate of convergence which are characterized by the ratio: $\lim\limits_{k \to \infty} \df...
For this problem, I heard that using a difference array can solve the problem but I can't seem to figure out how to solve this problem. Could anyone give me some advice? Please keep it simple since I am only a high school student preparing for the national infomatics Olympiad. Given an array of numbers, we can constru...
While reading a chapter about FSM, I was stuck on the following slide: In fact, I have been unable to determine what are "state registers" and "code registers", which were not explained in the course. Therefore, I have used to search for the definitions on the net, but I haven't yet found any result.
I'm working on exercise 16.3-5 of CLRS: Prove that if we order the characters in an alphabet so that their frequencies are monotonically decreasing, then there exists an optimal code whose codeword lengths are monotonically increasing. Perhaps I'm misunderstanding the question, but how can the lengths be monotonicall...
I am going through the following series of lectures on OS development . http://www.brokenthorn.com/Resources/ In the fourth tutorial , I came across the term " OEM" parameter block that stores the windows MBR and the Boot-record information whose soul purpose is to describe the file system on the disk . And then on mo...
So, the task is to prove the following: If S is a schedule containing at most one write action, then S is conflict-serializable. The answer is yes, but I disagree, because the following schedule contains at most one write action, and is not conflict-serializable: R1(A), R2(A), W2(A), R1(A). Am I completely wrong? O...
Does anyone know how to solve the below? I'm guessing that I need to use the Subtraction method or iteration but still I'm having a hard time with it. $$T(n)=3T(n-1)+3^n\times n^2$$
We have the following Lemma and proof: Lemma 5.5. If $A$ if FPT, then $A\leq_{\mathrm{fpt}}$ Independent Set. Proof. We reduce $A$ to Independent Set parametrised by $k'$, where $k'$ is the size of a sought independent set. Given an instance $(x,k)$ of $A$, solve $(x,k)$ in $f(k)\cdot \mathrm{poly}(|x|)$ time, (the r...
So i know that DCFL is not closed under union, but what about union with RL? Because what if both of the languages can start with the same string?then when we are building the DPDA for the union and for example both of them can start with $a$ then how can we determine whether its for the RL or for the DCFL?
Arora-Barak says It has also happened a few times that the first polynomial-time algorithm for a problem had high complexity, say $n^{20}$, but soon somebody simplified it to say an $n^5$ time algorithm What are some examples of the above statement? I know AKS is one, are there any other?
$ L = \{ w ∈\{0,1\}^* \mid |w|_0 = |w|_1 \mod 5 \}$ So i tried figuring out why this is CFL and whether its DCFL or not but i couldn't come up with any PDA! I'm studying for my exam and this was on the book, the book says its CFL but doesn't say whether its DCFL or not and does not draw any PDA for it! i tried m...
I am given a connected, weighted undirected graph. I must obtain minimum possible weight sum of "marked" vertexes in the graph. Vertexes must be marked so that each simple cycle contains at least one "marked" vertex. I will approach this problem by: using DFS on each node to obtain list of all possible cycles. I must...
Why does an NFA that accepts/rejects bit strings implemented with a Recursive Backtracking algorithm outperform one that is written using a Parallel Bitmap search? set up two tests for these algorithms, to evaluate on both different length strings, and different numbers of inputs: First, I created sets of 1,000 rando...
I am given an array $A$ having $n$ elements and an integer $k$. I need to find the longest subsequence which always includes the first element and the subsequence follows the given condition: for all $i < j$: $|A[i] - A[j]| \leq k$. Example: $n= 4$, $k = 5$, $A = [1, 2, 50, 6]$ Answer: the longest valid subsequence, ...
Let's define the following languages over the alphabet $\Sigma=\{0,1\}$: H10 is the language of all strings that are encoding of diophantine polynomial equation with integer coefficients and $n$ unknowns/variables that has at least 1 integers root/solution, i.e. there exists a root/solution in $\Bbb{Z}^n$ that solves t...
This problem takes place on a coordinate plane. I need assistance in creating the algorithm to solve this problem. I am solving this problem in java if you are interested. I have 1 carpet and 2 tarps. The 1 tarp covers the carpet (note in some scenarios it may not cover it at all). The second tarp will cover the remain...
I am trying to solve this problem and I am stuck. I think it is B, but I think I'm wrong. Thanks. Which of the following expressions is TRUE if and only if NOT all three variables a, b, and c have the same value? A. a != b || b != c B. (a == b || b == c || a == c) C. a >=b && b >= c && c >= a D. a > b || b > c || a >...
Im struggling to understand how to transform Nondeterministic finite automaton (NFA) of the following form: To a regular expression equivalent. What I have tried was using arden's rule. However I just cant figure out how to simplify and return the appropriate regular expression corresponding to that NFA. First I have ...
In this question Farewell Stack Exchange suggested to use karnaugh maps to solve the satisfiability problem by simplifying the entire/whole boolean formula by simplifying subformulas until you have reached a contradiction or the current boolean formula cannot be simplified anymore. ratchet freak answered that this meth...
$h(i,k)=(h^{}_{1}(k)+i * h^{}_{2}(k)) mod |T|$ as it defined in wikipedia I would like to know if it possible that Double Hashing return the same value for given $k$ when $i=1$ and $i=2$. Or from the other side, is it possible to build $h^{}_{2}$ in such way to that it never happen?
Let us define the following languages: $$ {L_1 = \{\langle M\rangle : M \ \text{is a TM and $\exists w\in \Sigma^*$ s.t $M(w)$ repeats a configuration infinite times}\}} $$ $$ L_2 = \{\langle M\rangle : M \ \text{is a TM and on all inputs there exists a configuration that repeats infinite times}\} $$ My questio...
I am given the the coefficients for an ellipse in the form: $$Ax^2 + Bxy + Cy^2 + Dx + Ey + F=0.$$ I have a 2 dimensional array of point objects (in Python) called "pixels", and I need to give each point a "count" if they lie inside the ellipse. I initially tried iterating through every point with a loop like: for row ...
Suppose, in the context of the classic marriage problem, two equal size groups of $n$ men and $n$ women are being matched, with the GS algorithm. If a man were to switch the order of a pair of women, low on his preference list, say $x$ and $y$, would this yield any sort of advantage with regards to being matched with a...
This is more of a practical question for me, but I have a few team members $n$ who I'd like to sort by two characteristics (just call them $a$ and $b$ for now). These characteristics are just a rating (given from 1-10). Among these $n$ team members, I am trying to find those who fit a definition of being good i.e. give...
Let < M > be an encoding of a Turing machine. L = { < M > | M is a Turing machine that accepts a string of length 2014 } Above language is R.E(even though we have infinite TM's) as we have finite amount of strings of length 2014 and we can apply dovetailing method. My doubt is can we apply dovetailing if we have infin...
Grammatical Framework is based in Abstract Categorial Grammars. It is known that Combinatory Categorial Grammars have grammar induction/learning capabilities see e.g. https://link.springer.com/article/10.1007/s11168-007-9026-2 and there are also works about statistical learning in Cornell Semanatic Parser framework. Bu...
As the title says, i have the following excersice: An associative mapping cache with four lines in each set, can store in each line two words of 16 bits each. It can store 4K words, that they have length 32bits from Main memory. The CPU is 16 bits and the address that he produces is 24 bits length. So the solution is ...
Suppose that we have an array $A$ of $n$ elements with some partial order known, e.g. for example as a $n\times n$ matrix containing $c_{ij} \in \{-1, 0, 1\}$ where $0$ represents unknown and $-1, 1$ represent $A_i < A_j$ and $A_i \geq A_j$ respectively. Is there an efficient algorithm that counts the number of partiti...
I've finally more or less understood the recursive algorithm for solving the Towers of Hanoi. My Python code is below. However one thing still bugs me - I can't yet work out how this simple seeming algorithm can "know" which move to make first - whether to the destination peg or the spare peg. I can see it depends on w...
Problem Description Given an array $A$ of $n$ integers, find the minimum number of operations to turn it into a new array $\widehat{A}$ with a (weakly) descending order: we require that $\hat{a}_i \geq \hat{a}_j$ for all $1\leq i<j\leq n$. Here an operation means either increasing or decreasing an element by $1$. For e...
I stumbled upon a statement like the following, in the context of prediction (classification) with a neural network: "If we predict the class of a given data point $x$ with random weights, the output will be random and thus the classification will be wrong in most cases." This is true, no doubt about that. But what wou...
Does someone know how to solve the below? $$T(n)=2T(n-1)-T(n-2)+5n+7$$ $$T(n)=2T(sqrt(n))+(logn/(log(logn))$$ $$T(n)=T(sqrt(n)[5])+log(log[3]n)$$
Can someone explain to me (perhaps with an example) why $AF (\phi \lor \varphi)$ is not equivalent to $AF \phi \lor AF \varphi$. This seems counter-intuitive, because in any path where $\phi$ (or $\varphi$) is true, $\phi \lor \varphi$ is true as well. Or is my reasoning wrong? Thanks
Are there reductions from SETH (Strong Exponential Time Hypothesis) to lowerbounds against threshold circuits? (maybe for computing Boolean functions of the form OR-of-AND-of-OR) In threshold circuits I am allowing for circuits which end with a summing gate and hence these circuits are computing real valued functions...
Some definitions, just to not create confusion: A sparse graph is a graph that contains a number of edges less or equal than the number of vertices. In $k$-clique problem we are given a graph and an integer $k$, and the task is to decide whether the graph contains a $k$-clique. I think that even if we have a sparse g...
i don't know if right answer is 4 or 5 ! what did you understand from this question if it was a QCM ? thanks
Here is my question: Given a compressed suffix tree of string S and a substring T. I need to return all substrings of S that begins with the substring T sorted by lexicographic order. My approach: I can traverse the suffix tree and find the edge / node which last letter of T is written on it. The subtree of this edge b...
I learned that when you have a binary heap represented as a vector / list / array with indicies [0, 1, 2, 3, 4, 5, 6, 7, 8, ...] the indicies of the children of element at index n can be found with $leftchild = 2n + 1$ $rightchild = 2n + 2$ I can see that this formula works and have played around with it for a little b...
Given a set $S$ with a finite number of elements, where each $s_i\in S$ is itself a set with a finite number of elements, how do you partition $S$ using as few partitions as possible, such that all elements of $S$ in each partition are disjoint? For example, given $$S = \{\{1,2\},\{2,3\},\{1,4\},\{1,2,4,5\},\{2,5\},\{2...
I have a distance matrix which is created through a predefined pattern (or formula) and I want to find elements with minimum distance "d" from each other, in order to do that I search for the maximum clique in the graph which is created with distance matrix. Knowing that there exists a pattern in the distance matrix ca...
Can Lamport's Bakery algorithm be used for controlling concurrency in soft real time database system (case study of stock trading)?
$L$ is the language accepted by the above PDA : $L = \{a^n\mid n\geq 0\}\cup\{a^n b^n\mid n\geq 0\}$ and is deterministic context-free is the language accepted by the PDA how can we accept $a^n$? As it doesn't contain an epsilon transition at the end right ? Is acceptance by both the final state and empty stack possib...
I try to understand and apply nested Monte Carlo Research. Yet, after reading its designer's paper I didn't understood why he added an if after an if-else condition. Shouldn't the last if be always skipped ? Indeed, in nested(position, level) we can find at line 3 and 5 if and else conditions. When would the second if ...
We say that the language $L$ is Cook Levin deterministic reducible to xor satisfiability in polynomial time if and only if for each word $w\in\Sigma^*:w\in L\iff f(w)\in XORSAT$ where $\Sigma=\{0,1\}$ and $f:\Sigma^*\rightarrow\Sigma^*$ is the function in the Cook Levin reduction that was introduced in 1971. In other w...
Given a string, I have to return the smallest possible value of $k$ such that all of its sub-strings of length $k$ have at least one common character. Each sub-string must have the same common character. Examples: y d c b f Answer = $3$ (common character is 'c') n n n n n n n n n Answer = $1$ (common character is '...
I have to demonstrate Prim's algorithm for an assignment and I'm surprised that I found two different solutions, with different MSTs as an outcome. Now I now that shouldn't happen, so I wonder what I did wrong ? Here is the exercise: The first solution (using Prim's) is visiting the nodes in the following order: v0,v...
I have a problem where I am asked to explain why the language that has words made of $a$ and $b$ such that the number of $a$'s is equal to the number of $b$'s, can be generated by a context free grammar. I am not sure of what is asked here, will finding such a grammar work? What should I do?
Suppose I have a tree $T=(V,E,w)$ with vertex weights $w(v)\ge 0$ for all $v\in V$. I want to partition this tree into $k+1$ trees by cutting $k$ edges such that the deviation from the mean of the sum of vertex weights in each partition is minimized. Is there an algorithm to get a good approximation in polynomial time...
In the textbook by Arora and Barak in Chapter 1 and section 1.7 they have proved how a UTM can do simulation in $O(T \log T)$ time. I have read it and understood everything except that how the $k$th shift can cost just $O(2^k)$ time. One can read the proof for complete details but I can explain my doubt as the followin...
When converting NFA to DFA, do I always get the minimal DFA or not?
I was talking to a professor who made a comment to my question. Me: So much of quality literature around this topic ( IP Protection for Neural Weights) emanated in 1990-1991, I'm truly at loss to understand what went wrong. Why did everyone suddenly stop worrying about this topic? Prof: I think AI was starved o...
Words synchronous and asynchronous can be met several times, in different contexts, when studying computer science. As an example : Synchronous and asynchronous circuits. Synchronous and asynchronous calls. Synchronous and asynchronous messages. I never really understood the real meaning of those terms, and also the ...
For given array $A$ of size $N$, note that the array is going to be permutation of the numbers from 1 to N, each number will be there exactly once, we want to obtain data structure being able to perform two types of operations. A. Update operation: Reverse the elements in the range $A[l_i \dots r_i]$ B. Query operation...
I understand how to use linked lists, and build algorithm using them. But I don't understand how can we prove their correctness, even of simplest algorithm. I haven't even found a good tutorial reference. Googling suggested that Cormen's book should be a good starting point. His discussion about linked-list (section 10...
I'm new to computer vision and am looking for advice. I'd like to perform computer vision on a spiral system, in this system a down flowing liquid separates into different regions based on density: The regions can be visually distinguished based on colour. What I'm hoping to do is automatically detect changes in the a...
There is a list of objects. Each object cannot be in a bin with some other objects. How can I find the minimum number of bins required to hold all the objects (and the objects in them)? My current algorithm: For each object in the list, see if any of the currently existing bins will hold it. If yes, stick it in the fir...
PROBLEM Given a set of features $A = \{a_1, a_2, \ldots, a_m\}$. You have a set of objects $X = \{x_1, x_2, \ldots, x_n\}$ such that each object has certain combination of features. Some objects can have no features at all. Some other objects may have all of them. Two different objects may have same sets of features. I...
In trying to design an algorithm, I needed a datastructure to implement a restricted kind of set partition refinement, where the sets $X$ to split on are subtrees. Specifically, given an arbitrary tree $T$ (computed earlier in the algorithm), and an initial partition where everything is in the same set, I need to do tw...
I am reading this example of FSA from book Martin & Jurafsky "Speech and Language Processing". As per definition of FSA you can only transition to one state after consuming one input. In this example if the input is say "twenty" to which state it will transition q2 or q1 ? Say if the input was "twenty one". After cons...
I do not understand how a program such as an interpreter can run and create code "on the fly" to run. Can someone help me understand what such a program would have to do in order to function? I'm familiar with the process that a compiler takes the input file, creates the AST, produces the machine code, then the result ...
I know being a decidable language doesn't necessarily mean that every subset is of it is decidable, but does every undecidable language contain a decidable subset?
The problem is, we are given points $p_1,\ldots,p_n$ on positions of a length-$n$ binary sequence $x_1,\ldots, x_n$, and if the $i_{th}$ position of a sequence is $1$, then we "earn" $p_i$ points. So the total points is $\sum_{i=1}^{n}x_ip_i$. Our rule is that we cannot have three consecutive $1$'s, and we want to know...
I need to learn about accumulator machines, but there is next to nothing written about them. Computer architecture channels seem to be flooded with general-purpose register ISAs (like MIPS, x86, etc). I know that accumulator machines only have one register (called the Accumulator Register) that is implicit and not spe...
I encountered the following interesting problem on stackoverflow: Given numbers $a(1)<\cdots<a(n)$, find a permutation $\pi$ that maximizes $$\sum_{i=1}^{n-1} a(\pi(i)) a(\pi(i+1)).$$ The answers there claim that the answer doesn't depend on the numbers themselves, and is always given by the order $$\ldots,a(n-5),a(n...
I was trying to understand the definition of countable set (again!!!). Wikipedia has a very great explanation: A set $S$ is countable if there exists an $\color{red}{\text{injective}}$ function $f$ from $S$ to the natural numbers $\mathbb N$. If such an $f$ can be found that is also surjective (and therefore $\color{...
To prove that the set $\mathrm{DIAG} = \{\langle M\rangle \mid \langle M\rangle \notin L(M)\}$ is not decidable, we can assume, to the contrary, that there is a Turing Machine $M$ such that $L(M) = \mathrm{DIAG}$. Consider the string $\langle M\rangle$. By definition of $\mathrm{DIAG}$, $\langle M\rangle \in \mathrm{DI...
I am interested in solving a variant of the coin exchange problem. Recall the formal definition of the coin exchange problem: Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = {S1, S2, .. , Sm} integral-valued coins, how many ways can we make the change? The order of coi...
Obviously it always depends on the specific case. However, my question is how to label data efficiently without writing a source code from scratch which solves the final problem itself? For example, suppose that I want to use the $k$-Nearest Neighbours algorithm to classify tables from images according to their shape (...
So this is how i solve it but someone told me its wrong: $B-C = B\cap \overline C $ and since $B\cap \overline C $ is r.e and B is recursive recursive sets are closed under intersection then $\overline C $ is not Recursive(because if both of them were recursive then the intersection would be recursive), also since r.e ...
As I teach myself dynamic programming, I have learned about the coin exchange problems. Specially this site: https://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/ provides great insight about it. Specifically, the following implementation of a tabulated-DP-based solution for this problems is presented as...
In the paper "Simrank++:Query Rewriting through Link Analysis of the Click Graph"(http://www.vldb.org/pvldb/1/1453903.pdf), the formula to compute the similarity between $q$ and $q'$ is as follows: \begin{align} s_\mathrm{weighted}(q,q') =&\ \mathrm{evidence}(q,q')\cdot C_1\cdot\\ &\sum_{i\in E(q)}\sum_{i\in E(q')} W(q...
I was reading about the differences standards and specifications for C. I understood that programming languages are usually stadardized and I learnt that there are different approches to stadardization. Anyway I did not understand yet what this terms refer to. If I think to C, I believe it refers to a standard API, th...
I was recently watching a video on the classes of P and NP, in which it was claimed that there have been 'several' problems that were presumed to be in the class of NP, which have since been shown to be in the class of P. Unfortunately, no examples of such problems were given. Could anyone verify this statement by prov...
We know that std::vector in C++ is implemented as a dynamic array with specific pattern of reallocation (multiplying capacity by a constant), which allows it to reach O(1) amortized push_back time. But changing capacity of a vector is essentially allocation of new memory block and copying old data into it. That means w...
I´m looking for an efficient algorithm that will find reverse cartesian products. Mathematically, given $S \subseteq T^n$, I want to express $S$ as a union of sets $A_{i,1} \times A_{i,2} \times \dots \times A_{i,n}$, for $i=1,2,\dots,k$; and I want to minimize the number $k$. Is there an efficient algorithm to solve ...
how can i prove Demorgan's law (X+Y)'=X'. Y'?I already tried studying book but doesn't understand the first step so plz answer in detail.(beginner here)
Introduction I'm trying to formalize (generalized) Turing machines in Mizar (Wikipedia) and I'm looking for the optimal way to formalize the (generalized) tape. Note that you don't need familiarity with the system to answer. I will present two ways for formalization and I ask you to think of different approaches that m...
Is it possible to do an edge detection using ONLY opening and closing operations? Where: opening- $X\bullet B = (X \ominus B) \oplus B$ closing- $X\circ B = (X \oplus B) \ominus B$ (I know we can do it with erosion dilation)
I have to find an evaluation function in which we evaluate the state of the game in each round. The game is like " roborally " , it is 2 player-Game in which there are a board and cards that decides my movements on each cards there is number of translations , number or rotations.The goal of the game is ...
While asking this question on "what exactly is standardization", I remebered that another related term that always came up while reading about C libraries was the term "specification". To avoid asking more than one question in a single post, I decided to open another post that I hope will clarify what is the difference...
I'm learning about CRC and Hamming distance and I have three questions. Lets say we have binary code described by ($+$ refers to sum modulo $2$): \begin{alignat*}{1} a_1 &+ a_2 &+ a_3 &+ a_4 &+ a_5 &= 0\\ a_6 &+ a_7 &+ a_8 &+ a_9 &+ a_{10} &= 0\\ a_1 &+ a_6 &+ a_{11} &&&= 0\\ a_2 &+ a_7 &+ a_{12} &&&= 0\\ a_3 &+ a_8 &+...
I need to draw a combinatorial circuit that when an integer is greater than 7 and is an odd number, the output will be 1. There are 4 inputs representing 4 bits and 1 output wire. The output wire is only 1 if an integer is greater than 7 and is an odd number. My attempt: If I segment the 4-bit input as r x y z where if...
I want to learn Artificial Intelligence techniques by writing a game (or maybe any fun project). Can you suggest any games? Consider that I'm a beginner in AI, but have basic knowledge Algorithms and Data structures (graph algorithms and stuff like that). I'm going to use Python.
Perfect partition problem (PPP): given $x_1,...,x_n\in \mathbb{N}$ we want to know if there's a set $S\subset \{1,2,...,n\}$ such that $$\sum_{i\in S}x_i=\sum_{j\notin S}x_j.$$ Single machine task schedule problem (SMP): a machine can perform only one task $T_i$ with duration $d_i$ at a time and we want to know if all ...
I'm studying for an exam on Advanced Computer Architecture and in an exam question the question above is asked. I know that branch prediction is crucial in superscalar processors in order to exploit ILP as much as possible, but I was wondering what could be the precise reason why superscalar processors use dynamic bran...
Does there exist a general algorithm which can output a finite and complete description of the (programming) language in which it is written, if it is given the permission to execute programs in that language? The description should be sufficient to associate a correct output for any given program in that language.
L = {< M > $\mid$ L(M) = M halts on all inputs in atleast 100 steps }. Answer to this question is given undecidable in my book without any explanation but I think it is decidable. $\overline{L}$ = {< M > $\mid$ L(M) = M halts on some input in atmost 100 steps } For the above language, we can feed strings of length r...
Suppose I derive my application problem as the following type of optimization problem: $$\min_X ||X||_{2,1}+||X^\top||_{2,1}+||X-A||_F,$$ where $X$ is a (square) matrix, $A$ is a constant matrix. I am wondering is there any current optimization algorithm can solve this optimization problem (better with some convergenc...
So I'm currently taking discrete math II at my university and I came across a somewhat philosophical question (so I apologize if this is question is hard to answer precisely) of whether mathematicians and computer scientists view computation in the same way. We computer scientists define computation with the Turing mac...