instruction
stringlengths
35
11.4k
A language $L$ is PSpace-complete, if it meets two conditions: It is in PSpace. Every other PSpace-complete language reduces to it in polynomial time. Question: suppose we change the second condition to polynomial space (instead of time)? Why is it so that then SAT would be PSpace-complete?
How many automorphism does a clique with 6 vertices have, when we take two edges from it (two edges that don't have the same vertex)? I thought the answer is 6*(n-2)! Number of automorphism for a full graph Kn is n!. Clique can be seen as a full graph since all of the vertices must be connected to each other. Since we ...
Number of different paths (length N) between vertices x and y inside of a clique Kn or a bipartite graph Kn,n? I am looking for simple paths. Therefore, in case I have n vertices N can be maximum n-1. For example, if n=4, we have maximum M = 3. For 3 we have 8 different paths, for 2 also 8 and for 1 only 6. I have done...
$INFINITE_{DFA}\equiv \{(A)\mid A \text{ is a DFA and } L(A) \text{ is an infinite language}\}$ Here $ (A) $ denotes the encoding of DFA Is above language regular, CFL or recursive ? I know that above language is recursive for sure. I am not able to decide whether it's regular or not. For regular, we know that regul...
Let's say we have a graph $G$. We pick one edge from it (any edge). Will there always be such a spanning tree that contains that very edge? I think the answer is yes, because no matter what we do we can always create such a spanning tree so that the very edge we picked is included. Of course, a more formal proof would ...
I occasionally see these terms used and I'm not really sure what is meant by all of them. Is it possible for an asymptotic bound that is not Big $\Theta$ bound to be "tight"? What does it mean for bounds that are not Big $\Theta$ to be tight? Is there a difference between a tight Big $O$ bound and a Big $\Theta$ bound?...
How can it be proved that any minimum edge cover is a forest? As far as I understand an edge cover could be one connected component therefore a spanning tree). If it's the case then it wouldn't be a forest.
How can it be proved that if there's an algorithm which in polynomial time determines whether a graph has a Hamiltonian cycle then there's an algorithm which can find such Hamiltonian cycle in polynomial time as well? Note: there's no need to devise the actual algorithm I just need to prove that one causes the other ...
I want to analyze a clustering algorithm that clusters data stream. Since the stream can be unbounded, I cannot write O(N^2), or explicitly denote the size of the stream. How can I use the arrival rate of the data for the computation complexity? Do you have any other idea for correct analysis of stream computation (for...
How come $REC$ languages are included in $NRE$. The definition of a language in $REC$ is . $L \in REC$ if there is a turing machine $M$ that recognizes the language $L$ and that stops on any given input. It makes sense that $REC$ is included in $RE$; $L \in RE$ if there is a turing machine $M$ that recognizes the lang...
I'm going through a video of EDX course which talks about Big O notation. At the end of the video they have some questions but the $O(n^2)$ answer is confusing me. It feels like a mistake, but I just want to make sure. The question is : Imagine that we have a data set of 10 items. We run an algorithm on that data set,...
I'm starting to learn machine learning, and have honed in on a problem to get my hands dirty with: how to detect a trend reversal in a time series. I've asked this question on stats.SE more than a year ago, but now I'm looking for a machine learning approach. How would I go about this specific problem vs. generally id...
Given two Turing machines $M,M'$, is it possible to check whether $M$ invokes $M'$? In other words, is the following problem computable/decidable? Inputs: Turing machines $M,M'$ Question: Does $M$ ever invoke $M'$? Perhaps we can look whether $M$ includes the code of $M'$ in it? In a C program we can check whether a f...
Let $T$ be a (possibly improper) binary tree with $n$ nodes, and let $E(T)$ be the sum of the depths of all the external nodes of $T$. (In a proper binary tree each node have 0 or 2 children. An external node is a leaf, i.e., any node that is not an internal node.) Is there a configuration for $T$ such that $E(T)$ is...
It seems intuitive to solve a 2D dot-to-dot travelling salesman problem by eye using a greedy strategy. However we can only solve the TSP by eye if the graph is topographically accurate e.g. if A to B is 10 and A to C is 10 then B to C can't be 1000. Is the greedy strategy still sub-optimal when we obey 2D scaling, ie ...
I am new to Context Free Grammars and am having trouble wrapping my head around how to approach writing a CFG for the following language: L = {a^n b^m+n c^m | n>=0, m>=1} I have a basic understanding of how this should work, but the examples we went over in class usually only had either 2 symbols dependent on each oth...
I've tried a few tricky languages such as D = { w | w has an equal number of occurences of 01 and 10 as substrings} but I don't have the means to prove this one as being not regular (and I cannot confirm if it is or not). I know of the pumping lemma, which I have used on very basic languages to prove they are not regu...
Came across this question : State whether True or False A prime attribute can be transitively dependent on a key in 3NF Answer: True How could this be true? Because as far as I know, A relation initially in 1NF is said to be in 3NF when partial and transitive dependencies have been eliminated. Correct me if I'm wrong...
What is the possible biggest and the smallest number of edges in a graph with N vertices and K components? I think that the smallest is (N-1)K. The biggest one is NK. Is this correct? I think it also may depend on whether we have and even or an odd number of vertices?
Given a set of n jobs with [arriving time, service duration time, penalty per unit of time] find a schedule with lowest total penalty. Notes: Arriving time is the time when objects aarivies to processing system. All objects can arrive at the same time Processor is able to process only one object at the same time S...
I am trying to find the best poker hand in a connected grid, where order matters. An illustration is the best way of explaining the situation. This grid has 12 random cards, in random positions. Each card is connected to the vertically, horizontally and diagonally adjacent cards. The hands are standard poker hands but...
Given a set of Voronoi edges. Each edge consists of (indices of, pointers to) 4 points: $\mathrm{left}$ and $\mathrm{right}$ are sites, $\mathrm{begin}$ and $\mathrm{end}$ are vertices (one of them or even both (in case if all the sites lies on a straight line) may point to infinity). $\angle \Big(\overrightarrow{(\mat...
Right now I am trying to learn how to work with automata and regular grammar, and I encountered the following exercise: $(1^*01)11$ I found the following solution, but I am not really sure if it's right. What I didn't understand it's from where exactly I should continue after I close the parenthesis or start a new one...
Definition : An abelian group is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written Input : Two finite abelian groups $|G| =n$ and $|H|=n$ by their table representation Find : Is $G \cong H$? There is an $O(n)$ running time algorithm...
When I'm working on a algorithm problem, I can usually find a top-down solution that works with recursion. Then for optimization purpose I try to do a bottom-up approach (dynamic programming) to remove the recursion stack, and I struggle. I have a really hard time initializing the array with the correct value, and then...
I keep stumbling upon this term in my lecture notes tutorials and assignments, but I have no clue what it means, google doesnt give me anything usable at all. Here is an example how this term is used (material in german, but self explanatory really) So my question is: is this a regional dialect or some important techn...
This may be a known problem, with known approaches, but I can't find the right way to search for it. I would like to name points along a line of unknown final length such that their name reflects their relative position to all other named points on that line. One should be able to insert an arbitrary number of names a...
Given $n>0$, $k>0$, and a prime number $p$, compute: $$n^k\mod p$$ in $O(\log k)$ time. Here $x \mod y$ means the remainder for $x$ being divided by $y$. For example, $2^3\mod 7 = 1$. You assume that all of $n$, $k$, and $p$ can fit in a single word in your computer. Moreover, if $x$ and $y$ are numbers with sizes bou...
Basically, you have $n$ integers. The data structure is for your choice, it is ok to do polynomial time preprocessing on them. Then you have multiple questions "Is an integer $k$ in the set?" My question is about the best way we know in terms of time/space to answer this query. Ultimately, the time should be guaranteed...
Suppose an edge $e$ is in a minimum spanning tree $T$ of a graph $G$. If the weight of $e$ decreases by some positive number, how to prove the the MST is unchanged (still $T$) ? It seems obvious by Kruskal's algorithm if the weight of all edges are different, if the weights are same, or some of them are same, how to pr...
Suppose we have an undirected graph $G=(V,E)$ with $n$ vertices and with max degree of $d>0$. I need to prove that number of connected subgraphs of $G$ with at most $n\geq k>0$ vertices is $M\leq n\cdot d^{2k}$ My approach was by induction. For $k=1$ it is true Suppose we want to prove it for $k=n$ . let's take any ver...
I am trying to understand randomized AND-OR Game Tree Evaluation. I am stuck with proving the most basic case, namely, an OR node with two leaves (AND node with two leaves is similar). (OR) = 1 / \ / \ Possible inputs: 1 1 ...
I am working in grasshopper and need a formula that can divide any surface into equal points. I need an algorithm that can give me equidistributed points on the surface Chebyshev
Say we have some BNF rules for example: $$A ::= B C$$ $$Dx ::= ExFx$$ $$x ::= y$$ So we might start with $Dx$ and apply rule 2 to get $Ex Fx$ and then apply rule 3 to get $Ey Fy$. But starting with $Dy$ we can't get anything. Unless... What if we extend the BNF rules to let the rules apply to other rules. Then we could...
Show that the following graph is planar or not. My first assumption is that this graph is not planar, but could not find a reasonable prove (except saying that I tried drawing it in different ways in plane, but couldn't). We know that a graph is non-planar if it contains either K5 or K3,3 as minors. I tried getting I ...
Assume we have a sorted list of n numbers, I want to map those numbers to m buckets or clusters. For each bucket the average of all numbers in that bucket will be computed. The task is to find a mapping, so that the difference between those cluster averages and the original numbers is minimal. Example: List: [1, 2, 3...
I am looking for an example where the optimal solution for the LP problem is equal to the optimal solution of the ILP problem, but the solutions are different. All I managed to think of was the example of the knapsack problem, when the sum of all the weights were less than W (max weight). However, in this solution x=x'...
I've got a basic doubt for such I'm not getting convicting argument. See, We say a TM $M$ is Turing recognizer if it accepts a string belonging to the language $L(M)$ & says $yes$ if the string belongs to it. But how it will know when it should stop to arrive at decision? For e.g, suppose there is a string $w$ which be...
So I found a solution to this problem here http://marcodiiga.github.io/number-of-even-sum-subarrays but I am unsure of exactly how it works. I get the premise that in order to have an even sum it must be even or even + even or odd + odd. However, I am not sure how this person manages to take into account the fact that ...
Notations : AUT$(X)$ (where $X$ is a graph) is the group of automorphisms of the graph $X$ $G=\langle A \rangle $ means group $G$ is generated by set $A$. $G_{\{\Delta\}}$ is the set-wise stabiliser of $\Delta$ STAB Input : $A \subseteq \text{Sym}(\Omega)$ and $\Delta \subseteq \Omega$ Find : Generator of $\langle A \...
$$ L = \left\{ \left< M \right>~\middle|~ \small{ \begin{array}{l} L(M)\text{ is recognized by a Turing Machine} \\ \text{having even number of states} \end{array} } \right\}. $$ Isn't $L$ same as asking if $L\left(M\right)$ is recursively enumerable (RE)? How is it trivial? I know what it means for a property to be t...
I'm recently reading some papers on the maximum independent set problem, all the algorithms' time complexity is donated by $O^*()$ notation, like $O^*(1.0836^n)$. One paper says "the $O^*$notation suppresses polynomial factors in the input size." I'm a little bit confused and couldn't find helpful materials on the Int...
I am currently working on implementation of semantic segmentation of images neural network, and try to implement one of the already existing solution such as Fully Convolutional Neural Network 1. Data that I am using is based on Pascal-Context dataset [2], which has additional labeling to original 20-class PASCAL VOC ...
I'm reading papers on algorithms of maximum independent problem and the basic recursive branching rules is as follows: Let $G(V,E)$ be an $n$-node undirected, simple graph without loops, and $\alpha(G)$ be the cardinality of an maximum independent set of $G$. If $G$ is empty, output $\alpha(G)=0$(base instance). Other...
In call by name : In general, the effect of pass-by-name is to textually substitute the argument expressions in a procedure call for the corresponding parameters in the body of the procedure. Technically, if any of the variables in the called procedure clash with the caller's variables, they must be renamed uniquely be...
I've recently started learning CNN's. I need a CNN that is specialized for insects detection. Dead insects will be put on a piece of paper / container, then images will be taken from a same distance, and are at same pixels. I am expecting to prepare my own training datasets: - Thousands of images of a particular insec...
Let $L$ a language over $X = \{a\}$ defined as follow : $$L = \{ a^{n!} \ | \ n \geq 0 \}$$ I want to prove that $L$ isn't regular, I have searched in the forum for an equivalent question, but I found nothing. If it's a duplicate, I apologize and I'll be glad if you provide me the link of the duplicated question. I'll...
can someone pls help How do I prove 2⌊lg n⌋ = Θ(2⌈lg n⌉) 2 ⌈lg n⌉+⌊lg n⌋ = Θ(n2) I'm not too good at maths. I know, lim ( n -> infinty) = f(x)/g(x) if we get a real constant the statement is true.
Given an array $A$ of length $N$. There are $Q$ queries, each queries will be in the form What would be the c-th number in the segment A[l...r] if the array is sorted? I've come up with an $\mathcal{O}(N\log N+Q\log^3N)$ solution: Build a segment tree, keeping array A sorted in each subsegment. Binary search the valu...
I am having trouble writing the following optimization problem as a linear program (LP) $$\min_{x \in \mathbb R^2} \big| | x_{1} - a_{1} | - | x_{2} - a_{2} | \big|$$ where $a \in \mathbb Z^2$ is given. I tried adding the following constraints and replacing objective function to min $U$, but it did not work out. $$x_{i...
I'm working through a Database Design textbook, and one of the problems involving ER Diagram design is giving me some trouble. The diagram is for a UNIVERSITY database with the following rules: 1) The university keeps track of each student’s name, a unique student number, a unique Social Security number, address (s...
I came across following excerpt: $(x'y'+xy)'z'+(x'y'+xy)z=x\oplus y\oplus z$ What I see is left hand side is XNOR of $x,y$ and on right, $z$ and I get XOR of of $x,y$ and $z$ !!! In other word, $XNOR(XNOR(x,y),z)=XOR(XOR(x,y),z)$ Somehow I am surprised by the result, as I didnt came across this earlier, no text sta...
Standard Hopfield networks exhibit stable patterns (states) which are attractors of a dynamic system. I wonder how to modify standard Hopfield networks such that they exhibit stable limit cycles as attractors. Since for binary neurons (to which I'd like to restrict my question) each attractor is a limit cycle of some l...
I've proven that the Turing-recognizable languages are closed under concatenation and I need to show that they are closed under homomorphism. But what's really the difference? Doesn't closure under concatenation imply homomorphism as well? Or perhaps I misunderstand what homomorphism means when talking about Turing-R...
Recently I encountered some papers in which the most important part seems to be writing an Integer Linear Program for a problem for which there exist some exact or heuristic algorithms! Is solving an ILP easy and fast in practice? Is this solution exact or approximate?
A simple graph with $n$ vertices is constructed by randomly and independently placing an edge between every two vertices with probability $p$. What is the expected number of nodes with degree two? I was only able to find the probability of any vertex having degree 2. Let me explain what I tried. For any vertex we can ...
Every function problem has a corresponding decision problem, which is simply the graph of the function problem, according to https://en.wikipedia.org/wiki/Decision_problem#Function_problems which reads that the time complexity of a function problem and decision problem underlying decision problem "...may not be consid...
I am trying to fuse point clouds into one. These Point clouds are acquired from multiple cameras. Below is the detailed information about setup- Three Kinect v2 sensors are mounted on tripods in such a way that they are making 120 degree angle from each other in a horizontal plane. Hence one can assume that these Kinec...
we know that SQL standard is equivalent to First Order Logic (FOL). I've seen at my lecture that graph connectivity cannot be expressed by FOL, so in SQL as well. But we know that we can easily solve that problem in PTIME. And I've seem the following table: Query Language Data Comp. Expression Comp. FOL ...
I work with python and images of tables (taken from above). My aim is to take a photo of a random table and then find the most similar tables to it in my database. By most similar I mean tables of similar shape(square, rectangular, round, oval), texture, colour etc. For now, I am just running a PCA and then a KNN on al...
I'm trying to learn about Graph Spanners. I have searched for it but unfortunately, I couldn't find any solid helpful resource related to this very topic. I would highly appreciate if anyone can suggest me any specific book or online material which explains about Graph Spanners in detail.
We all know that, at least theoretically, there are several possible models of computation, varying in structure. Strictly speaking, there are several (not just one) models of computation that exist or have been implemented in real life. Some machines (for example, amplifier circuits), though inexact, can be considered...
The recurrence equations solved by the Master Theorem are in the following format : $ T(n) = a T(\frac{n}{b}) + f(n) $ but is it possible to use it on : $ T(n) = a T(\frac{n}{b}) + c $ ?
My question is short and straightforward: Can be considered "machine learning" a subarea of "expert systems"?
This question is specifically related to https://stackoverflow.com/questions/3980416/time-complexity-of-euclids-algorithm The $gcd(x,y)$ is solved in $O(T(n) log n)$, where $n$ is the number of bits of $x,y$, and $T(n)$ is the time to multiply two $n$ bit numbers, as described in How is the Time Complexity of a Functi...
I have a problem with a task shown below. I have I am supposed to use big M method, but I don't know how to estimate/compute the minimal value of it and how to implement it into the equations. Any help would be much appreciated: Use binary variables to algebraically express the set $Y$ defined as the set of all those ...
Well, I am following this video lecture (MOOC) and I came across this quiz where I have to convert $(Q\to R)\wedge (R\to Q)$ to sentence. $Q$: "I will go to town" $R$: "I have time" My answer to $(Q\to R)\wedge (R\to Q)$ is "I will go to town ONLY IF I have time AND I have time ONLY IF I will go to town". Whereas, t...
This is the PDA to accept strings with equal number of $a$'s and $b$'s. The $\epsilon$ transition in the first state is causing nondeterminism. When we have input a with Z at the bottom of the stack, then at the beginning it can do $(a,Z/aZ)$ or $(\epsilon,Z/Z)$ and go to final state, so automaton has 2 choices which ...
In a nutshell I found this paper that provides an upper bound for the amount of iterations we expect before visiting the global optimum at least once. (It then uses that number to find a lower bound on the probability of finding the optimum within a given number of steps). The trouble is, when I plugged in some numbers...
My book says that If $P < N/2$ then we know that N is the dominant term so we an drop the $O(P )$." If it was $O(N + P)$ where $P > N/2$ what would it reduce to?
I am using KD trees to do nearest neighbour searching. My understanding is that it takes $O(n \log n)$ effort to create the tree where $n$ is the number of points and that it takes $O(m \log n)$ to do nearest neighbour searching for $m$ query points. In my application, $m$ is in the tens of millions and so most of the...
I have the following AVL tree and want to AVL-INSERT a node 5 into the tree. Since the middle branch will be unbalanced, I'm guessing that it will require a right rotation, then a left rotation to rebalance the tree. However, what would the actual steps to rebalance the tree look like? Before insert (balanced): 3 ...
I am using a Hidden Markov Model with Gaussian mixture emissions to cluster a sequential data (I am using hmmlearn in python 3). Initially, I used the log likelihood to find the number of clusters and gaussian mixtures, however, this value kept increasing as the complexity of the model grew (the number of states and mi...
Given a Deterministic Finite Automata (DFA) $M_1$, does there always exist a Pushdown Automata (PDA) $M_2$ that accepts the same language as $M_1$? I.e. can any DFA be simulated by a PDA? Intuitively, it makes sense to me that a PDA is more powerful since it has an arbitrary amount of memory and can therefore accept ...
Convert in postfix (((P+Q)(R+S))/T) +(A(B+C)) note : there is * between (P+Q) (R+s) My attempt in image and size of stack = 15 given, but iam getting size =13
I'm having issues with a question how to identify which instruction are represented by this microcode. The pc starts at 5000 and 7000 and 7001 have values 31 and 64 - I'm really confused how to approach this wouldn't each line be an instruction? MAR = PC, PC+1, Assert MAR IR = MBR, decodes IR put addr 7000 into ...
I'm having some issues understanding what happens on a context switch with the physical register file in an out-of-order CPU that implements context switching. Suppose that a CPU consists of 4 hardware thread contexts and that the ISA consists of 32 architectural registers. Does the physical register file get overwritt...
If A and B don't have parents on a Bayesian network, does that mean we can infer A and B are independent? Whatever the answer is, please explain how you get to it.
I'm working to solve a problem based on two non-binary tree graphs, that they need to be iterated together in order to find a valid combination. I did a basic implementation that works, but it have a few flaws. Let me first explain a bit. The point is that I have two trees, and each node have "n" children nodes, and th...
I'm currently studying the B-Trees chapter of Introduction to Algorithms. One of the question from the chapter is: Suppose that we insert the keys $\{1,2,...,n\}$ into an empty B-tree with minimum degree 2. How many nodes does the final B-tree have? I think given that a node will have between $t-1$ and $2t-1$ keys, w...
The main difference between Dijkstra algorithm and Bellman Ford algorithm that all texts (including CLRS) specify is that Dijkstra's algorithm need all non negative edge weights, while Bellman Ford algorithm can work with and detect -negative edge cycles. However I feel a bit different, especially after coming across ...
I'm new to LTL and Buchi automaton, and I have a hard time in constructing NBA from the given formula or the property. Could somebody please help me? The following property is given, P= "Whenever process 1 is in its waiting location (w1), it will eventually enter its critical section (c1).” where AP = {w1, c1}. I have ...
I came across following problem: Problem 1 Suppose that minimum spanning tree of the following edge weighted graph contains the edges with weights $x$ and $z$, then what are $x$ and $z$? The solution given was as follows: There are two ways to reach node $F$, one from node $A$, other from node $G$. Maximum weig...
I can't find a mistake in reasoning : Let $M_1$ NTM (Non Deterministic Turing Machine) that solves $L$ in polynomial-time. So then $x \in L \Leftrightarrow M_1(x) = 1$. Finally our new NTM $M_2$ that solves $\bar{L}$ is inverted $M_1$ : $x \in \bar{L} \Leftrightarrow M_2(x) = 1 \Leftrightarrow M_1(x) = 0$. And since ...
I'm trying to understand the analysis of bucket sort in CLRS. Specifically, equation 8.2 that states: $$ E[{n_i^2}] = 2 - \frac{1}{n} $$ To prove, CLRS: Random variable denoting number of elements that fall into bucket i: $$ {n_i} $$ An indicator random variable that a given element in the input falls into a particular...
If I understand correctly, the term "consensus" in distributed consensus algorithms means that all the participants ("peers") achieve a common understanding of some data value. Different algorithms can handle different types of failures or misbehavior by some of the peers, network disconnections or partitions, lost me...
I have been thinking of a problem i have here with a calendar scheduler where i basically want to split a year into seconds and have access to the dataset of whole year. In this year i assign blocks of time that varies in size can be big or can be small, it has to be placed in non assigned places ( which isnt occoupied...
What is the difference between a final and accepting state when addressing an automaton? As I understand it, a final state is depicted (traditionally) with a double circle, and apparently so is an accepting state. So if they are both depicted with the same symbol, what makes a state particularly accepting?
I'm trying to assign running times to loops of code to roughly get the upper asymptotic ($O$) running time. while (j < n2) { # executes n2-1 times int k = 0; while ((k < n1) && (seq[k] < seq2[j])) { # executes (n2-1)*n1times ...
I have slight modification for graphs which has negative weights for finding shortest path . If the graph has all non negative weights then by Dijkstra's algorithm , it can be done in O(VlogV + E) . So for the graphs having negative edge weights , find min(weights) = K and subtract K from all weights so that we end up ...
I'm trying to figure out a way to think about this problem. Background: Given an unsorted array of distinct integers (can be positive or negative), I want to determine if there is an element in the array that is equal to its rank (i.e. if I do $S = Sort(Array)$, I want to find an element s.t. $S[i] = i$). Some approach...
I know that linked list is not a appropriate data structure for building heaps but I am interested in knowing the time complexity of building heaps and heapsort using linked list. One of the answers here (https://stackoverflow.com/a/14584517/5841727) says that heap sort can be done in O(nlogn) using linked list which i...
I have a connected graph $G$ with $k$ different colors assigned to $n$ nodes where $k<n$. All edges have unit weight. I want to figure out an algorithm to find a minimum sub-tree of $G$ that covers all $k$ colors (i.e., such that for each color, there is at least one node of this sub-tree with that color; and minimizi...
To check some results of an article, I wrote the proposed algorithm from the Coding articles. In the article, some results from the algorithm were obtained. Unfortunately, the performance of my program was very different from what was said in the article. In the article, results were obtained in 20min but I got quarter...
This is a school assignment, I am fairly new to DFA's. L = {ww|w∈{0,1}* I feel like I need to put this in words to understand how it works. Translating L: W can be a string of an infinite combination of 1s and 0s. WW is just a string that repeats itself. For example W="101011", WW = "101011101011". Im not a 10...
Is it possible for an AI neural net to be able to modify its own parameters/hyperparameters and/or add new parameters/hyperparameters? If so, how has it been implemented? For example, to simulate a human mind, could the net utilize 3 basic emotional parameters before realizing it needs many more and subsequently creati...
My proof was deemed false because it does not work for infinite regular languages, but I don't understand why. Prove: "If we remove one string from any nonempty regular set, the resulting set is still regular. I used to lemmas: A set containing only one string is trivially a regular language The union operator is clos...
I'm working on a problem related to Latin squares, and I want a method for what essentially boils down to the decision problem: Input: A finite, simple graph G. Output: YES if G has a non-trivial automorphism, NO otherwise. Hence... Question: Is there an efficient algorithm for determining whether or not a graph has a ...
It is within polynomial hierarchy so I assumed it is decidable. The picture like this further hinted in that direction. Yet, in a paper on page 2 I read Satisfiability of [...] is highly undecidable (i.e., $\Sigma^1_1$-hard) which implies that $\Sigma^1_1$-hard is undecidable. Do authors mean something else by "highl...
Suppose that I want to compute all the prime numbers between 2 and $n$. The natural way or most obvious way to do so is given below. Let $A$ is an array contain the numbers from $1$ to $n$. For $j=2$ to $j=\sqrt n$ mark multiples of $j$ from $A$ Running time of this algorithm is $O(n \log n).$ It is easy to see that ...