instruction stringlengths 35 11.4k |
|---|
So far I have learned about categorial grammars, type logical grammars and formal semantics of natural language, the relevant tools are Cornell Semantic Parsing Framework https://github.com/clic-lab/spf and Grails 3 Type Logical Theorem prover http://www.labri.fr/perso/moot/grail3.html. My preferences are strongly bias... |
Im having difficulties understanding how to solve the knapsack problem using dynamic programming, where v is value and w is the weight, where I can fill up to a maximum weight j for some Capacity_J:
capacity_J
J_0 J_1 J_2 J_3 J_4 J_5 J_6
... |
I have a undirected tree and three colors to choose from. Some nodes are already colored; these nodes and their colors are given. What is an efficient algorithm to find the number of ways to color the rest of the nodes such that no two adjacent nodes are the same color?
|
I'm looking for efficient algorithm distributing atomic resources with arbitrar weight among a number of buckets with random capacity. Buckets can be added or removed, and resources from removed buckets should be redistributed among remaining ones. Are there any known algorithms solving this problem? Consider both situ... |
I'm trying to fully understand how the recursive Towers of Hanoi Algorithm works and to implement it in code.
Something that keeps throwing me of is the use of phrases like "move n-1 discs from A to B using C."
I understand that the peg which is referred to is as being "used" is the auxiliary or spare peg, but the lang... |
I think I understand that a P class problem is reducible to an NP class problem (P≤NP).
I´d like to understand if I need to figure out a potential algorithm which could solve the NP class problem to know if it can be used as a subroutine for a P class problem.
So for example, if I ask you if the problem from class P —... |
I'm looking for a good review paper or book chapter that offers an accessible introduction to the computational complexity of training neural networks for classification problems.
In particular, I'm trying to study questions like:
How is training complexity related to network topology ?
How is training complexity r... |
Recurrent neural networks makes it possible to implement some kind of memory, which can be very useful for a lot of tasks, incl. (but not limited to) robot control, which I am interested in. For example, echo state networks are known to display some kind of dynamical short-term memory, and display a very small search s... |
I have the non-deterministic context free grammar $$I \to abcX | abdY$$
$$X \to X d | \epsilon$$ $$Y \to XX |I$$ and i want to convert it into a deterministic. I know that the rules $I \to abcX | abdY$ and $X \to X d | \epsilon$ are causing the grammar to be non-deterministic so i rewrite them as $$I \to abI', \ I' \to... |
Imagine you have a number of 2-dimensional objects. The question is how to fit them all in a rectangular space in such a way that this rectangle takes the smallest area possible.
On the below image you can see (more or less) what I mean:
The objects are packed quite efficiently (there is little empty space).
What I am... |
I have to show if the following statement is true or false. Suppose we have two problems $A$ and $B$. We want to know whether the following is true:
If $A \le_p B$ and there is an algorithm which solves $B$ in linear time, then there is an algorithm which solves $A$ in linear time as well.
So we recently started with... |
The language $ L = \{ a^nb^mc^m : n,m \in \mathbb{N} \} $ is non regular. Suppose this needs to be proven using the pumping lemma for regular languages:
Be $ z = ab^nc^n $ such that $ z=uvw, |v| \geq 1, |uv| \leq n $.
Obviously $uv^2w \notin L $ with $ v=b^{k}$ and $ 1 \leq k \leq n-1$.
Is this proof finished now? Or d... |
The Complexity Zoo states that ACC$^0$ is contained in TC$^0$ and links to the paper On ACC and Threshold Circuits. However, what the linked paper proves is that depth-3 threshold circuits of quasipolynomial size can simulate ACC$^0$ circuits.
Wouldn't it be necessary to prove that constant depth threshold circuits of... |
FLP86's famous proof regarding impossibility of async distributed processes with a single fault assumes in the proof of the third lemma the existence of an event $e'$ such that the neighbor configurations $C_0$ and $C_1$ can be related as
$C_1 = e'(C_0)$.
I don't get how this is possible, as it seems to me like $e'$ c... |
Is the set of real numbers a language?
My idea is that the set of real numbers can't be a language because it is uncountable. Every language must be countable.
Is there any other way to solve this problem?
|
There are m people and n kinds of objects. Each person has exactly one instance of each kind of objects, but these objects have different values associated. Now I want to find a subset of objects from all those m*n objects satisfying the condition: it should have p objects of each kind (p < m), and a person cannot cont... |
We have a directed simple graph $G$. Out-degree of any vertex is at most $k$ in $G$. We need to show that $G$ is $2k+1$-partite.
|
I have a graph $G$ on which I try greedy coloring; i.e. I order the vertices and then start coloring them according to their order and I assign each vertex the smallest possible color available to it. (It is easy to see that this might not be the optimal coloring possible)
So after the coloring, we see that a vertex ha... |
By Burhman, Fortnow and Thierauf result Paper Link, we know that $MA_{EXP} \not\subset P/poly$.
Also, we know that $MA \subseteq P^{NP}$ (or $\Delta_{2}^{P}$ in some literatures).
By using the padding technique, we can conclude from this $MA_{EXP} \subseteq EXP^{NP} \not\subset P/poly$ and hence yielding a circuit lo... |
I want to know if a specific version (and what´s its name?) of the Set Partitioning Problem is NP-Complete, and if, is NP-Hard?
Problem:
Given a set of elements $e_i$ where $i={1,...,n}$, each with an associated weight $w(e_i)$, we want to find an optimum partition of these elements into a set of $S_j$ subsets where $j... |
I'm working on a HW assignment as follows:
Given the primal canonical problem: $$min \langle c,x \rangle \text{ s.t. } Ax \geq b, x \geq 0$$
and the canonical dual problem: $$ max \langle b,y \rangle \text{ s.t. } A^Ty \leq c, y \geq 0$$
Show that converting PC (primal canonical) to DC (dual canonical) is similar when ... |
Given a PDA $P$, I believe we can simulate it with a turing machine with 2 tapes - one for keep reading the input and one for the stack.
But, a PDA transition function may have multiple transitions for a given state, letter, and the stack top (the non-deterministic part, or splitting). How can we deal with that in a tu... |
I have a hardware RNG that sends me some random bits. Due to nature of that RNG, the source is biased. Then, the bitstream is processed in a following way to remove the bias:
two counters are used, which count amounts of 1's and 0's in the stream and when the difference is above the threshold, the next bit out ot the r... |
Let the algorithm be defined as follows:
Consider the following heuristic algorithm for finding the maximum size clique
in a graph. (1). Delete from the graph a vertex that is not connected
to every other vertex. (2). Repeat (1) until the remaining graph is a clique.
Now, how do I show that this algorithm does not give... |
Let's say for some $n$ we have the sequence $1, 2, 3, \dots , n$, what we want with this sequence is to divide it in two sets such that each element of the sequence will be in only one set, and the difference in sums of the two sets will be minimum possible.
Example
Let $n = 4$, and $A$ and $B$ are our sets, we can div... |
What is meant by the term 'state' in a finite-state machine?
I have not seen a proper definition on the web and am looking for a university-level answer.
Thank you in advance.
|
I've got an TSP problem which I can't seem to solve somehow. It consists of about 1200 addresses for which all distances (measured in seconds) between them, a frequency (once a week, twice a week, 3 times a week etc...) and cargo-weight are given.
I've looked into TSP solutions, but they only seem to offer ways to calc... |
I have the following recursive function:
$$
T(n) =
\begin{cases}
\theta (1) & \text{if $n$ = 1;}\\
T(\sqrt{n}) + \theta (log(n)) & \text{if n $\geq$ 2}\\
\end{cases}
$$
I tried:
\begin{eqnarray*}
T(n)&=&T(\sqrt{n}) + log(n)\\
&=&T(\sqrt[4]{n}) + 2 log(n)\\
&=&T(\sqrt[8]{n}) + 3 log(n)\\
\end{eqnarray*}
I can't find a ... |
In this thread I am seeking for an advice or a starting point on how to solve the following riddle. I need to come up with an algorithm which will generate all possible combinations, but I don't know where to start. In this example let's assume that we have 3 value pairs
1 2
2 3
3 1
The aim of a riddle is to make as... |
A weighted graph $G= (V, E, W_1, W_2)$ has two cost functions $W_1, W_2 : E \rightarrow \mathbb{R}$. Each edge $e$ has two costs $W_1(e)$ and $W_2(e)$. We may think the costs as representing different resources, such as time and fuel. Similarly, a path $p =e_1, e_2, \dots e_n$ has two costs,
$$W_1(p) = \sum_i W_1(e_i)... |
In general, the subset sum problem is NP-Complete. However, what if we say that our set is $\{1,...,n\}$? Is there a formula/combinatorial calculation that says how many subsets of $\{1,...,n\}$ have their sum equal to $k$?
|
Also, are they equivalent or are they different?
Examples of algorithms/Turing Machines that run in complexity of one but not the other would be much appreciated.
|
In Python, we have metaclass and abstract class.
In Java and C#, we have interface and abstract class.
The relation between a metaclass and a class is instantiation, so it extends the instantiation relation between a class and an object.
The relation between an abstract class and a class is inheritance, so it extends ... |
I have a sequence like 5577334... and there are 3 frames available.
After the 6th clock, all pages (5, 7 and 3) will have their reference bits set to 1.
Now, when 4 comes in, 5 will go even though its reference bit is 1 because of the FIFO rule but what happens 7 and 3' referance bits? Do they stay as 1? or Is 7's ref... |
Consider the $q$-ary erasure channel with erasure probability $\alpha$, i.e. given $x\in\mathbb{F}_q$ with probability $\alpha$ it outputs $?$ and with probability $1-\alpha$ outputs $x$.
For a linear code $\mathcal{C}$ generated by an $n\times k$ matrix $G$ over $\mathbb{F}_q$, we take a decoder $D:(\mathbb{F}_q\cup\{... |
I'm learning about NEAT from the following paper: http://nn.cs.utexas.edu/downloads/papers/stanley.ec02.pdf
I'm having trouble understanding how adjusted fitness penalizes large species and prevents them from dominating the population, I'll demonstrate my current understanding through an example and hopefully some one ... |
Assume we are given a LP maximization problem defined by a linear functional $c^Tx$ and a non-empty feasible region $\{x:Ax\leq b\}$ that is known to be bounded by a hypercube of side $R>0$, say $[0,R]\times \dots \times [0,R]$. Asume that problem data is real: $A\in\mathbb{R}^{m\times n}$, $b\in\mathbb{R}^{m\times1}$,... |
Problem: 3SUM
Input: Three lists A, B and C of integers and an integer k. Each list contain $n$ numbers.
Task: Decide whether there exists a tuple (a, b, c) ∈ A × B × C such that a + b + c = k.
Question : Is it possible to solve 3SUM in $O(n^2)$ time using constant space ? Prove or disprove it
|
2.(10 pts) a) You are given 4 processes in a batch system that all arrive at time 0 with the following CPU burst times:
P1 : 35, P2: 25, P3: 13, P4: 22. Assuming there is no context switch overhead, draw a time line chart
(Gantt chart) showing when each process executes under each of the following sc... |
Going with the definition, that order of a B+ tree is the maximum number of children a node can have.
What is exactly meant by the order of a leaf node? As per my understanding order of a leaf node is the number of pairs it can hold.
But in general when order of a B+ tree is defined in a question like, order is 5. Exa... |
Question:
Given:
Class B IP address 169.202.0.0.
Network when divided into 4 sub networks, each one requires 16,000 IP addresses. They need to be assigned sequentially without gaps.
Find the sub networks.
Here is my solution:
Total IP addresses in 1 subnet are 16000 = 2^14 – 384 Bits required for subnet: 4 = 2^2 = 2... |
i'm trying to figure out whether this Union $\left [ L_1=\{a^lb^mc^m|l,m\ge 0\} \cup L(b^*c^*)\right]=K$ is regular or not, now since regular languages are closed under intersection, so i assume $K$ is regular then its intersection with $L(a^*b^*)$ should be regular which is $K\cap L(a^*b^*)=L(a^*)\cup L(b^*)$ right ?... |
A group of computer scientists associated with numerical analyst Yaroslav Sergeyev have published numerous publications recently on a scheme proposed by Sergeyev that uses terms like Infinity Computer, numerical infinitesimal and numerical infinity, claiming that the approach facilitates the solution of many problems. ... |
$L_1 \in \mathrm{CFL} \cap L_2\in \mathrm{CSL}$ is $\mathrm{CSL}$ because every $\mathrm{CFL}$ is $\mathrm{CSL}$ and by applying closure property of $\mathrm{CSL}$ under intersection, it's $\mathrm{CSL}$.
$L_1 \in \mathrm{ RL} \cap L_2 \in \mathrm{CFL}$ is same as $\mathrm{CFL} \cap \mathrm{CFL}$ . As $\mathrm{CFL}$ i... |
Currently there are two things that may change between invocations of a function: the return value, and the external states. I understand that if the external states changes, the function is not idempotent. However, it seems controversial whether the return value is required to stay the same. For example, is the below ... |
function (n)
i = 1
s = 1
while (s <= n)
i = i+1
s = s*i
print "*"
end
|
I am thinking of a modified version of pacman. In this version, it will be a two-player game. Each player will have one pacman and one ghost. So there are 2 pacmans and 2 ghosts in the board at a time. No additional ghost is there. A player will control both his pacman and ghost separately- there is no predefined or ra... |
Are there efforts to automatically discover new logics? Logics are simple structures - they have formal language, deduction rules, semantics and certain properties that are proved or discarded for every new logic. In fact, each logic can be put into framework of institutions (by Diaconescu et al).
So - is it possible t... |
What is the difference between Boolean Algebra and Boolean Lattice? I have already searched on Google but could not find a reasonable answer?
|
Let's say there is an algorithm that runs on a processor at x MIPS, operating at a clock frequency of y MHz. If I double the operating frequency to 2y, what happens to the MIPS? It seems to me that doubling the operating frequency should double the instructions executed per second, i.e, MIPS = 2x, is this correct?
|
I am reading Lamport's paper titled Time, clocks, and the ordering of events in a distributed system
I understand what's in there more or less, but I am confused whether Lamport timestamps on their own are useful in practice since just by looking at the logical timestamps, we can't say anything about which happened bef... |
I am having trouble in writing the specific role of Turing machine? can it solve all the algorithm a digital computer can solve(i.e. today's PC's)?
|
This is a question that is in a sense a follow-up of a question I asked earlier, and which was answered.
In that question, the answer to "in which recursion scheme does data only flow bottom up, and in no other way?" was "a catamorphism".
Here, I am looking for the name for (and hence: theory about) the reverse recursi... |
Given an unweighted graph $G = (V,E)$. I am interested in enumerating all pairs of disconnected cliques, i.e. there should not exist any edge between two cliques. (For example, there would not exist any such pair in a complete graph). A clique could be of any size $\geq 1$.
Are there any standard approaches to solve th... |
I'm a beginner in programming with little knowledge about the technicalities. I'm assigned to do a "reading project" on the average case analysis of quicksort. I mean I have to present it in class. Now, I need a good source from which I can read it and find the materials which I can include in my presentation. As for m... |
I am trying to solve the exercise 3.3 in Approximation Algorithms by Vazirani, pg 34. It states
3.3 Give an approximation factor preserving reduction from the set cover
problem to the following problem, thereby showing that it is unlikely to have a better approximation guarantee than $O(\log{n})$.
Problem 3.14 (Dir... |
While studying recursion, I came to know that for every function call it has to store intermediate data on stack for later use. If so, then for large amount of data, recursion can be inefficient. Storing large intermediate data can cause memory overflow. Can you please explain, then why recursion is used at all? If p... |
As it says in the title:
Are there problem instances which we know to be unsolvable?
Or equivalently
Are there any promise problems with a finite number of possible inputs
which are undecidable?
Please note:
I realize that many computational problems are known to be unsolvable, but to the best of my knowledge (li... |
I am going through the book Compiler Construction by Niklaus Wirth. The following is what I feel to be stated summarily by his lesson on procedure calls:
The compilation of a procedure call is the allocation of a block of stack memory. It starts with the base address which is stored in the frame pointer and the local... |
I read that the 4 conditions for deadlock prevention are necessary conditions and not sufficient.
The four necessary conditions are :-
Mutual exclusion.
Hold and wait.
No preemption.
Circular wait.
Here it is clearly mentioned that these conditions are only necessary but not sufficient.
https://cs.nyu.edu/courses/s... |
I see a lot of articles and topics about OpenCV and machine learning in regards to identifying general things (like cats, or alphanumeric characters) but I am wondering if something more specific is easier/detailed somewhere.
Basically, if I have a folder of 20 images, how would I identify those images contained with a... |
I am trying to solve following problem but unable to solve this. Can anyone tell me how to approach this kind of problems where it is not easy to make DFA.
The minimum number of states required to construct a DFA that recognizes the language of strings over the alphabet ${a,b}$ whose tenth symbol from the right end is... |
We need an optimal algorithm in pseudo-code for sorting a sequence of $n$ which has only $k$ distinct numbers ($k$ is not known a Priori).
Can we use Counting Sort to solve this problem in $O(n+k)$ time? I don't think so. Though the time complexity of Counting Sort is $O(n+k)$ but $k$ is the largest element in the inp... |
I have been studying Andrew Ng's Coursera course about Deep Learning. In that he mentions that we calculate the activation functions during the forward pass, and the derivatives $\dfrac{dL}{dz} \ $, $\dfrac{dL}{dw} \ $, and $\dfrac{dL}{db} \ $ during the backward pass.
Consider a single neural node
Here,
$x_{1} \ ,\ x... |
If it is beneficial, then how Big-O (time complexity) is affected?
Embedded link provided by members does not answer original question.
|
I'm reading the following article that presents a $log(k)$ algorithm for your secretary problem.
I'm in the analysis section at the left part of page 5 there is the following claim:
$B^*$ is a set with elements $x_1,...,x_k$ with respective values
$v_1,...,v_k$ where $v_1\geq...\geq v_k$. Denote $n_i(B^*)$ as the ... |
In a question i found the recurrence relation $a_n=a_{n-2}+3^{(n-2)/2}$ then i should solve this relation with using generating factor but $3^{(n-2)/2}$ makes difficult to solve . Is there a solution for such a relations ? Or is my answer wrong ?
|
The class $C_{1,\epsilon }$ of decision problems solvable by an NP machine such that
If the answer is 'yes,' at least 1/2 and at most $1-\epsilon$ of computation paths reject.
If the answer is 'no,' all computation paths reject.
Is there a name for this class that looks like $RP$?
Is this in $RP$ or $coRP$?
The class... |
Is the complement of $L = \{a^nb^mc^p \ , n= m= p\}$ a context free language.
I believe that we can write $L^{'} \ as \ L1 \cup L2$ where
$L1=(a^*b^*c^*){'} \ $
$L2={{a^nb^mc^p \ m\ne n \ or \ n\ne p }}$
Now L1 is context free. I do believe that L2 as context free. Since context free languages are closed under union ... |
I'm following this explanation on the P3P problem and have a few questions.
In the heading labeled Section 1 they project the image plane points onto a unit sphere. I'm not sure why they do this, is this to simulate a camera lens? I know in OpenCV, we first compute the intrinsics of the camera and factor it into solve... |
L = { < M > | M is a TM and L(M) <= { $0^n 1^{2n}$} }
Here <= means polynomially reducible to
Is L CFL?
If L(M) can be polynomially reduced to a CFL then L(M) should also be CFL as if "A" is reducible to "B" then we can solve "A" if we know how to solve "B" ? Where am I going wrong?
|
Let's say we have given simple undirected graph $G$ having $N$ nodes and $M$ bidirectional edges. For given $x$ and $y$ we want to check if in the graph there is only one simple path between them.
What I was thinking for, is that we should find all the cycles in the graph and run bfs from $x$ to $y$, if the path doesn'... |
I am a computer science student and at the moment I am starting a new subject called models of computing.
I am trying to understand what is the difference between a Turing Machine and an Universal Turing Machine.
For what I understand a Turing Machine can be compared to a program that runs on our computer and an univer... |
I have an n-element set, and I want to consider families of its k-element subsets of fixed size s. For example, if n = 3, k = 1, s = 2, we have these families:
{{1}, {2}}, {{1}, {3}}, {{2}, {3}}
In my problem n, k, s are not so small, e.g. s = n = 50, k = 20.
Let us say all such families are ordered lexicographically ... |
Question
What is the state of the art for relation/equality satisfiability problems and where can I find papers clearly describing algorithms used (Or even better: implementations of them. Or even better: javascript implementations - I know that's a long shot)?
I.e. How do I solve satisfiability of: x > 10 && y < 5 && ... |
Problem: We say that an item $x$ is of rank $m$ if there are $m$ items in the set less than $x$. Design a randomized algorithm to find all of the items in a set of size $n$ with rank greater than $\frac{n}{16}$ with probability of failure $\frac{1}{1024}$.
I had this problem on my final yesterday and it completely stum... |
Given a contiguous sequence of numbers in which each number repeats thrice, there is exactly one missing number. Find the missing number.
eg: 11122333 : Missing number 2
11122233344455666 Missing number 5
I think we can't do better than just going from beginning to the end and checking the count if a specific number c... |
I ask this question with regards to a grammar in Chosmky Normal Form. The definition states that the rules must be of the following forms:
A $\rightarrow$ BC
A $\rightarrow$ a
S $\rightarrow$ $\epsilon$
And A,B and C are non-terminal symbols, B and C are different from S and a is a terminal symbol. The definition als... |
Let us define the language (the complement of the Halting Problem):
$$
LOOPING = \left\{ \langle M,x \rangle | M \ doesn't \ halt \ on \ x\right\}
$$
The question is if $LOOPING$ is NP-Hard.
I'm pretty clueless about the answer. I know the the Halting problem is NP-Hard, but I can't seem to find a reduction from an NP-... |
Let's say we have given array $A$ consisting of $n$ integers, and integer $K$. Now we want to count number of indexes $i$ such that $A_i<K$. What is the easiest way to pre-process the array and answer queries for different $K$ fast. Note that the elements of the array will be small up to $10^5$, so it will be possible ... |
I have recently watched this introductory video on quantum computing where the speaker talks about $n$ Q-bits and the representation of $2^n$ states.
What I didn't get is the word state.How is it different from a classical computer working with $1$'s and $0$s in which each bit can represent 2 states ($0$ or $1$) so tha... |
I was aware of the fact that, if DFA needs to accept binary string with its decimal equivalent divisible by $n$, then it can have minimum $n$ states.
However recently came across following text:
If $n$ is power of $2$
Let $n=2^m$, so number of minimum states $=m+1$.
For $n=8=2^3$, we need $3+1=4$ states.
Else I... |
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.
MultiDequeue(Q){
m = k
while ((Q is not empty) and (m > 0))
{ Dequeue(Q)
m = m – 1
}
}
What is the worst case time complexity of a sequence of n queue operations on ... |
There happened to be a following question -
In any Chomsky Normal Form grammar $G$, how many nodes will all parse trees for terminal strings of length $n>0$ generated by G have?
I tried for some examples & arrived at the answer $2^{n}+1$ but it is incorrect & obviously trying examples is not a sophisticated way. The ... |
I understand that designing automatons is mostly a creative process but, a month ago I was having a discussion with a classmate about designing a NPDA or a DPDA that accepts a non-trivial language (trivial meaning, it is straightforward to design a PDA that accepts it) and he gave me a solution while mentioning an algo... |
I want create algorithm, which find a straight line which will separate the most objects from the class. The line must be parallel to the X or Y axis. Example:
Above example present two class: circles filled and unfilled. Red line is a solution to the problem. Has anyone the idea how to find such a simple?
|
There is a lot of work on decomposing these polynomials to irreducible factors without the modulo $x^{2^k}$ part. That doesn't really work for this problem (apart from giving some upper bound on the sparseness) because the modulo $x^{2^k}$ effectively allows dividing anything by any polynomial that has $1$ in it, so di... |
I came across following problem:
Which of the following problems is/are P-problems?
(I) Equivalence of DFA's
(II) Equivalence of NFA
(III) Equivalence of regular expressions
Now I know I there exist neat algorithm to find whether given two DFAs are equivalent or not. So (I) must be P-problem. I am doubtful abo... |
I came across following problem:
Given single state non deterministic pushdown automata $M$, whether $L(M)=\Sigma^*$ is decidable?
Now I know
for DPDA/DCFG/DCFL, universality problem is decidable.
for NPDA/NDCFG/NDCFL, universality problem is undecidable.
However I am not sure whether the same problem is decidable... |
I wanted to ask a simple question.
Lets say we have A, language of all the words with more then 3 letters. so it belongs to R.
and its complement , is the language of all words with less then 3 letters.
is it possible to say that I can define a turing reduction between them?
i thought about something like this:
$$
f(x)... |
There is this Prim's algorithm I am studying, the time complexity of which is $O(n^2)$ (in the adjacency matrix).
As far as I have understood,that is because we have to ckeck all the nodes per every node, that is, when checking the first node's best edge, we have to check edges from the current node to all other nodes.... |
Is a Turing machine without the ability to write on blank cells less powerful than standard Turing?
I think the answer is yes but i'm unable to find a computation that standard Turing machine can do but this machine can't.
Any ideas?
|
So as part of a theorem-prover/checker, I'm using Prolog to try to determine the equivalence of statements that have been parsed into tree form, e.g. $x=2$ is represented as eq(x,2), or $x=2 \land y\leq z$ if and(eq(x,2),leq(y,z)), and I want to determine if these statements are equal.
The way I'm currently (attempting... |
I'm attempting to teach myself something about genetic algorithms. I found a simple tutorial on it here, and it made enough sense that I was able implement the suggested example of generating a string of single digit numbers and simple arithmetic operators to total 42.
I then attempted the second suggested exercise des... |
I'm cross-posting from math stack exchange after receiving no answers there.
I came across the following very simple recurrence-style expression but am having trouble solving it:
$$T(2n) \in \theta(T(n) \log(T(n)))$$
for sufficiently large $n \in \mathbb{N}$.
My first thought was to take the logarithm of both sides and... |
TL;DR
There are exactly 255 possible 3-sat expressions with exactly 3 variables (more meticulously defined below). Of those, exactly 254 are satisfiable. There are exactly 4,294,967,295 possible 3-sat expressions with exactly 4 variables. Of those, how many are satisfiable? How did you get that number?
Problem Statemen... |
Give an algorithm that takes as input an array A sorted in non-decreasing order, and a value x, and that returns two indices (F and L) into A, where A[F] is the first value equal to x and A[L] is the last value equal to x. Your algorithm should run as fast as possible in the worst case. State the worst case running
tim... |
Given a weighted undirected complete graph G = (V,E). I am interested in finding all maximal cliques that have mean edge weight (mean of weights of all edges in the clique) at least k.
Most of the approaches that I have found so far solve clique problem in an unweighted graph. I am wondering if there are any algorithm... |
How to prove that diagonal language is NP hard ?
Any pointers in the direction would help.
I am aware of this question but all the answer gives is a definition of reduction.
Edit : Diagonal-language contains all strings X s.t. Mx(x) = 0 where Mx is the turing machine whose string encoding is given by x.
|
Disclaimer: I don't know much computational complexity theory. I am nevertheless curious.
If function $f(x)$ has a certain level of computational complexity (which I actually don't know how to measure), what can we then say about the computational complexity of the following indefinite integral?
$$\int f(x) \, \mathr... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.