instruction stringlengths 35 29.1k |
|---|
Can the following two statistics be bounded:
the proportion of halting programs vs non-halting programs
the proportion of decidable vs undecidable languages
For example, can we say that one class is much larger than the other, almost all problems are such and such, or both are similar in size?
By Chaitin's argument o... |
I am trying to solve "divide and conquer" recurrence relations of the type
$T(n) = a T(n/b) + f(n)$
using the Substitution/Inductive Methods ( NOT the Master Theorem ). Every site I see on the web suggests guessing a solution and then proving inductively that the guess is correct. And almost all the sites quote the sta... |
Let $M$ be an acyclic NFA.
Since $M$ is acyclic, $L(M)$ is finite.
Can we compute $|L(M)|$ in polynomial time?
If not, can we approximate it?
Note that the number of words is not the same as the number of accepting paths in $M$, which is easily computable.
Let me mention one obvious approach that doesn't work: conver... |
Say, I want to put N objects into a hash table. How do I figure out how big the size of the table needs to be to have K comparisons on average when the table is: half full? three quarters full? all but last full?
Basically, this is due to me not really understanding the theory. I tried googling it, but didn't get it ei... |
note: any tips toward making this more constructive will be highly appreciated.
I've dealt with ai-related problems, from searching algorithms, to computer vision, to machine learning. However none of which required planning, just algorithms following algorithms.
I'm not sure how effective will it be to implement AI Pl... |
Does anyone know what are the most efficient algorithms for factoring polynomials in a field of characteristic zero, i.e, a field that may contain infinitely many elements. I'm mainly concerned within the context of the field of integers but I wouldn't mind the rationals as well.
|
According to my limited knowledge we know that since Integer Factorization lies in the intersection of NP and co-NP it cannot be NP-complete unless NP=co-NP. However, do we know any other implications yet- like if P != NP, does this mean that Integer Factorization is necessarily not in P? Conversely, if Integer Facto... |
Are there advantages of implementing a singly instead of a doubly linked list other than space?
|
I wonder if the following two substitutions are correct:
$$(x\,y)[x:=y] = (y\,y)$$
$$ \lambda y. (x\,y) [x:=y] = \lambda z.(y\,z)$$
They are what I understand from http://en.wikipedia.org/wiki/Lambda_calculus#Substitution.
Although I can follow the rules there mechanically, I wonder why there is no renaming of $y$ to $... |
So in my school we have a day where everybody participates in different activities. Each projects can have like 10 members. The whole day is divided in 2 or 3 different blocks, in which the pupils assigned to the activity change. (So in block 1 pupil x takes part in activity a and in the second block in activity d).
B... |
I recently started to read abour dynamic programming, and I am doing an exercise on it.
The problem to solve:
Given a String, find the least amount of palindromes it can be split into, and
print out the solution.
I found this article on here:
Is there an algorithm for checking if a string is a catenation of palindrom... |
Consider an undirected weighted graph $G = (V,E)$, where $V \subset \mathbb{R}^3$ so the points are 3D, and the weight of an edge equals the (Euclidean) distance between its endpoints. Note that we're not given the coordinates of the points in V. We may not even be given all pairwise distances, so the graph need not ... |
I saw this link on cstheory:
https://cstheory.stackexchange.com/questions/6634/is-there-an-oracle-that-separates-two-complexity-classes-known-to-be-equal
but it did not provide specific details. Can anyone tell me what the specific oracle is (or direct me to a paper which does)? Also on a meta-level why does this not... |
What is the Big O class of the following expression:
$$2^{\log \log n}$$
I think the Big O is $2^n$ as I assume $\log \log n$ to be $n$. Is my assumption correct?
|
In this old exam-task I don't understand all the steps to convert the DFA below to a Regular Expression. The $q_2$ state is eliminated first.
The provided solution to eliminate $q_2$ is:
If we first eliminate $q_2$ we obtain an intermediate automata with $3$ states
$(q_0$,$q_1,q_3)$ such that:
We go from $q_0$ to $q... |
We are given an undirected graph weighted with positive arc lengths
and a distinguished edge $(a,b)$ in the graph. The problem is to
replace this edge by two edges $(a,c)$ and $(c,b)$ where $c$ is a new
node, such that the length of the path $(a,c,b)$ is equal to the
inital length of $(a,b)$, and such that the choice o... |
If I am correct, the concept of a "theorem" doesn't appear until the concept of a formal system is introduced. "Definition" is used more often than "theorem" is. So I wonder if the concept of "definition" also arise in a formal system, or some other "system" or "structure"?
Is the definition of something just a name fo... |
I study computer science and we have subject named Software Engineering, we learn that each software should pass through a long process starting from requirement engineering and ending with Evoluation (Change Requests, Bug reports, Quality management) all this is based on hierarchy its head is the Project Manager and c... |
Watching this youtube video: https://www.youtube.com/watch?v=w1leqkpDaRw it described the problem with the stable marriage problem, that the asking side get a better deal then the asked site. Meaning that the result may differ if the woman ask the men instead of the men asking the women.
I have test this and found it t... |
I read the paper about Relaxed Radix Balanced trees (RRB trees) and am trying to implement them. What I can't get is how insertion at an index should be performed step by step. Can anyone proficient in this data structure describe this procedure?
|
I'm trying to prove that
$\exists L_1, L_2 : L_1$ and $L_2$ are context-free languages $\land\;L_1 \cap L_2 = L_3$ is an undecidable language.
I know that context-free languages are not closed under intersection.
This means that I can produce an $L_3$, which is undecidable.
An example would be $L_1 = \{a^n | n \in \ma... |
Wikipedia says
The collection of regular languages over an alphabet Σ is defined
recursively as follows:
The empty language Ø is a regular language.
For each a ∈ Σ (a belongs to Σ), the singleton language {a} is a regular language.
If A and B are regular languages, then A ∪ B (union), A • B (concatenation), and A* ... |
Is a language $L$ regular, context-free, context-sensitive, recursively enumerable, or ..., if
$L$ is closed under
string concatenation, and/or
string repetition, and/or
taking substring?
Somehow related but not identical to https://cs.stackexchange.com/questions/28534/what-are-the-formal-grammars-of-the-following-... |
What are a generative grammar and an analytic grammar?
How are they different from a formal grammar?
Is the recursive definition of the language of a propositional calculus, a first order logic system, or the set of lambda expressions a generative or analytic grammar?
|
I'm interested in how software emulators of old game consoles work. These must consist of an interpreter for the machine language of the emulated processor.
If I have understood correctly an interpreter, for each instruction: reads the instruction and scrolls a huge switch-case (or sequence of if-elseif-...) like stru... |
It is my understanding that, when one is describing time complexity with $\mathcal{O}$, $\mathcal{\Theta}$, and $\mathcal{\Omega}$, one must be careful to provide expressions with regards to the size of the input as opposed to the input itself (particularly in the case of numeric algorithms).
For instance, trial divisi... |
I'm interested in getting a Ph.D. and would love to work on a project such the GEC project at Microsoft Research, which studies the application of programming languages for synthetic biology and genetic engineering. What groups are doing work like this in a university setting?
|
Let f be a one-layer neural network which is linear (ie. no activation function). Let it have $p$ inputs and $q$ outputs. These are fully connected by weights $W$. We have $n$ inputs $x \in \mathbb{R}^d$ and $n$ outputs $y \in \mathbb{R}^{d'}$. We arrange these (column) vectors into matrices $Y$ and $X$, and the weight... |
Problem
I've got this function:
$f(x,y)=(6-3\cdot x)\cdot(y+2)$, with $(x,y)\in\mathbb{N}^2$
Now I have to find $g=\mu f$.
Proposed solution
My solution was to find the smallest $n\in\mathbb{N}$ to find $f(n,y)=0$ and show that $\forall 0\leq m\leq n : f(m,y)$ is defined:
$f(0,y)=(6-0)(y+2) = 6y+12$, defined $\forall y... |
What is the purpose of the $\mu$ operator?
Is there a real world example?
Is it correct that it can create partial
functions out of total functions and it makes a function $g$ with k
parameters out of a function $f$ with $k+1$ parameters?
|
How expensive is sorting integers on a Multitape Turing Machine? Well known sorting algorithms, like quicksort, tend to rely on jumping / indirect-access being cheap. But MTMs have no indirect access... how much does losing that cost us? Also, MTMs can't use log-sized words.
Say we have $N$ integers from $[0, 2^B)$. It... |
So the problem is, given some set $M = \{x_1,x_2,\ldots,x_n\}$ and a set of subsets $S = \{S_1, S_2, \ldots, S_m\}$ where $S_i \subseteq M$. We want to find some set $X \subseteq M$ such that $|X| \le k$ and $X \cap S_i \neq \emptyset$ for all $S_i \in S$.
My solution, I would take some set $M = \{x_1,x_2,x_3,x_4\}$ a... |
I'm more concerned with just finding big oh since that can be used to find big omega. I am also told I cannot use limits to find the answer.
I'm given:
$3+9+27+\dots+3^n$. My first assumption is that $3^n = \Theta(3^n)$. The method we're supposed to use goes something like this:
$3+9+27+\dots+3^n<3^n+3^n+\dots+3^n$
Or ... |
I simply need a standard way to find the upper and lower bound of a running time equation (please no shortcuts that only work for this specific problem)....
Example: $T(n)=\frac{c}{5}(4^{\left \lfloor \log_{4} (2n^{2}) \right \rfloor +1}-1)$
I think I understand how to put it in $\Theta$, $\Omega$, and $O$ after I get ... |
I just finished the AP Computer Science course in high school and since my school does not have any further classes, I was thinking about getting a textbook and continuing my study. APCS goes through Big O, Arrays + ArrayLists, Recursion, Linked Lists, a rough overview of some other data structures and some sorting and... |
I am newbie with this property testing and I am trying to understand it with a few examples. I first dealt with a toy example.
I did not understand the first step of the test in the following slide. Why is the first step $S= 2/\epsilon$?
Could someone please explain me in more detail (i.e. with a concrete example)? I ... |
Referring to this Question, where an answer is stating that all Type 3 languages are LL(1), I'd like to know if all Type 3 grammars are possibly LL(1).
If not, why is it so? Are there maybe ambiguous grammars in the set of the Type 3 grammars?
|
Is there already modified version of selection sort that works like this pseudocode:
a // the array, index starts at 1 (not zero-based)
n = len(a)
for x in 1 to n
big = x
small = x
last = n-x+1
for y in x+1 to last
if a[big] < a[y] then big = y
if a[small] > a[y] then small = y
if big <> small
i... |
I'm reading through the HoTT book and I have a (probably very naive) question about the stuff in the chapter one.
The chapter introduces the function type
$$ f:A\to B $$
and then generalizes it by making $B$ dependent on $x:A$
$$B:A\to\mathcal{U},\qquad g:\prod_{x:A}B(x)$$
and that is called the dependent function type... |
In the 3rd edition of Sipser's Introduction to the Theory of Computation (example 1.56, p.68), there is a step-by-step procedure to transform (ab U a)* into a NFA.
And then the text ends with: "In this example, the procedure gives an NFA with eight states, but the smallest equivalent NFA has only two states. Can you fi... |
I have a generic traversal algorithm for graphs:
Traversal (container) {
while (container is not empty ){
visit container.pop()
push new nodes
}
}
and I want to make a time-efficient "child head count" for nodes that sets a flag for nodes whenever all their children have been visited:
Traversal... |
What is the difference between multilayer perceptron and linear regression classifier.
I am trying to learn a model with numerical attributes, and predict a numerical value.
Thanks
|
Assume the halting problem was decidable.
Is then every recursively enumerable languagerecursive?
|
Does anyone know of a fast algorithm to compute factorials and/or binomial coefficients in general or modulo a composite number in particular (for composite moduli I am interested in the case where the factorization is not necessarily known) I know that for primes and factorials we can apply Wilson's Theorem but I was... |
An hypervisor (1st type) is a software that creates and run virtual machines, managing guest's operative systems's requests to the hardware.
An exokernel is an operative system kernel, that let's programs access directly to the hardware or, with the support of specific libraries that implements abstactions, run differe... |
I am looking for an algorithm involving adding unweighted edges to an empty, undirected graph (with vertices) and then for each, updating the table of shortest paths.
An example is if we have vertices 1 to 5. We can see that initially, all of the paths are infinite except for the diagonal entries, i.e.:
1 2 3 4 5
1 0... |
I'm going through an exercise trying to store address references into a direct mapped cache with 128 blocks and a block size of 32 bytes. The address are 20000, 20004, 20008, and 20016 in base 10.
When I start to store them, I realize that the offset is the only value that changes. All of the examples I find determin... |
SML uses pass‑by‑value, Haskell uses call‑by‑need. Unless I'm wrong (the purpose of this question), one can do call‑by‑need with SML, passing a function instead of a value; a function to be later evaluated when needed.
Adapting a classical example:
(* This will print `0` *)
fun pass_by_function (cond, a1, a2) =
if ... |
For my job, I need to pick up a working understanding of the implementation of type systems (in particular, how to write typing rules based on a design document). I've been given a copy of Types and Programming Languages and that's great, but I'd really like to watch someone work through it.
In my school, the course th... |
I have a directed acyclical graph. Each node represents an event with start and end dates and each edge represents a constraint between to events with 2 properties:
max interval between previous event end and next event start
min interval between previous event end and next event start
When an event's date is updated... |
Im sorry if it is a weird question, but I cant seem to find an answer for this. What does the signal going to the screen look like in more abstract sense? Does it code the values of each pixel in a huge matrix, is it a computational stream that instructs the screen what to present?
In other words, can I grab this signa... |
I've landed to SML pages, comparing call‑by‑name and call‑by‑value, asserting the former always succeed while the latter may fails. As this seems counter intuitive to me, I feel at least an example case would be useful.
Call-by-value, call-by-name and call-by-need
Theorem (Church Rosser 1)
For a purely functional lang... |
I've been asked the following question:
Given a connected undirected graph $G=(V,E)$ and a weight function $w: E \to \{1,2\}$, suggest an efficient algorithm that finds an MST of the graph.
After a few clarifications, the algorithm should run in time $O(|V|+|E|)$. I believe we can do this because of the fact that the... |
Based on: J. P. Carvalho, "On the Semantics and the Use of Fuzzy Cognitive Maps in Social Sciences" (WCCI, 2010 -- PDF) and Richard Dagan's web page Cognitive Mapping.
A cognitive map consists of nodes representing concepts and ties indicating relationship between the concepts.
In Carvalho section IV, the semantics is... |
Suppose I give you an undirected graph with weighted edges, and tell you that each node corresponds to a point in 3d space. Whenever there's an edge between two nodes, the weight of the edge is the distance between the points.
Your goal is to reconstruct the relative positions of the points, given only the available di... |
I am trying to figure out a way to create routes for trucks to complete a list of orders(drops/stops), while minimizing distance traveled.
There is only ever 1 company warehouse in the area.
The trucks have to deliver based on capacity.
Each truck can hold a maximum (usually 18 pallets).
Each order will be for a... |
According to Peter Selinger, The Lambda Calculus is Algebraic (PDF). Early in this article he says:
The combinatory interpretation of the lambda calculus is known to be
imperfect, because it does not satisfy the $ξ$-rule: under the
interpretation, $M = N$ does not imply $\lambda x.M = \lambda x.N$ (Barendregt, 198... |
How can one calculate the winding number of a polygon given as
a list of vertices in some (counter-clockwise or clockwise) order?
The complexity of the algorithm must be linear time.
|
In the third page (the third paragraph in the right column) of the paper "Time, Clocks, and the Ordering of Events in a Distributed System" by Leslie Lamport, it says that
The reader may find it helpful to visualize a two-dimensional spatial network of processes, which yields a three-dimensional space-time diagram. Pr... |
Is there any approach to FACTORING that can leverage optimal substructure allowing the problem to be decomposed into smaller subproblems? That is, perhaps being unnecessarily verbose, until an easily solvable instance is encountered, at which point the ancestry of subproblems can be successively reconstructed from the ... |
I wonder which one of the two needs a larger input to achieve a decent accuracy:
programming language detection or natural language detection?
More details:
Definition of Language detection:
In natural language processing, language identification or language
guessing is the problem of determining which natural la... |
I have the following problem:
Given a string $x\in\{1,...,M\}^+$ of length $n$.
Let $S$ be the set of all words with exactly the same numbers of occurences of smybols as in $x$. In fact, $S$ consists of all permutations of $x$. We call this set the type class of $x$.
My question:
How to compute the position of $x$ in ... |
Let $\Pi$ be some counting problem which is known to be #$P$-Complete.
Does it imply that $\Pi$ is $APX$-hard (i.e. no PTAS for the problem exists unless $P=NP$)?
|
Below is a snippet about simply typed lambda-calculus from CS152: Programming Languages Lecture 9 | Simply Typed Lambda Calculus, on printed‑page 15, indexed 23.
$$
\frac {\Gamma, x: \tau_1 \vdash e: \tau_2}{\Gamma \vdash \lambda x. e: \tau_1 \rightarrow \tau_2}
$$
I read it as: if from a context $\Gamma$ containing $x... |
Several block structured languages (Scala, Go, Ruby, Julia, Quorum, ...) use semicolons as statement terminators, but allow newlines instead of semicolons under certain circumstances.
My question is: how can I represent Scala-like optional semicolons in a context free grammar? The specific issue is that some kinds of ... |
Let $\Pi$ be a parametrized counting problem, where the parameter is the solution cost, e.g. counting the number of $k$-sized vertex cover in a graph, parametrized by $k$.
Assume that $\Pi$ is $\#W$[1]-complete (a known problem for example would be counting the number of simple paths of length $k$ in a graph).
Does it ... |
The problem is as follows:
There are several rectangles in the plane (they are not necessarily axis-aligned), how can we index them in such a way that given a point $p$ we can quickly locate the nearest rectangle from $p$? The distance from a point $p$ to a rectangle $R$ is defined as the Euclidean distance between $p... |
Is there a deterministic parallel single-source shortest path algorithm (for graphs with non-negative edge-weights) that runs in sublinear time? The number of processors may depend on $n$ or $m$ (i.e., the number of vertices or edges) and the total work time may be worse than $O(m + n\log n)$.
The most suitable algorit... |
I'm looking at the Calculus of Constructions and its place in the Lambda Cube.
If I understand correctly, each axis of the cube can be thought of as adding another operation involving types to the simply-typed calculus, $\lambda_\to$. The first axis adds type-to-term operators, the second type-to-type operators, and th... |
S → aS | aSbS | (empty)
where the alphabet is {a,b}
in other words, the set of strings where any prefix has at least as many 'a's as 'b's.
|
I'm reading through the HoTT book and I have a hard time with path induction.
When I look at the type in the section 1.12.1:
$$\text{ind}_{=_A}:\prod_{C:\prod\limits_{x,y:A}(x=_Ay)\to \mathcal{U}}
\left(
\left(\prod_{x:A}C(x,x,\text{refl}_x)\right) \to
\prod_{x,y:A}\prod_{p:x=_Ay} C(x,y,p)
\right),$$
I have no issue u... |
I was wondering what the complexity of the following problem is:
Given: A flow network $N$ with a source $s$, sink $t$ and a number $k$.
Question: Is there an $s$-$t$ cut of capacity at most $k$?
Obviously, the problem is in P by standard methods. When trying to logspace reduce the P-complete LP-optimization problem,... |
I am trying to prove what is often titled the strong duality theorem. There is a hint in the book that I'm following, and I want to follow the method they have outlined for me. I will outline the problem:
Let A.1: Minimize $c^tX$ subject to $AX\ge b$, $X \ge 0$
Let A.2 (Dual): Maximize $Y^tb$ subject to $A^tY \le c$, ... |
As I've come across Grovers algorithm I dont understand why when computing F(X), which is an oracle function people use classical reversible circuits(toffoli, fredkin) to evaluate the circuit. Why can't it just be done using classical logic gates(and, or, etc) when the function doesn't have any thing to do with changin... |
I have a set of functions $F$.
The functions effectively take a set $S$ that is always a subset of a global set of all possible values $G$, where $|G|>1000$. (alternatively, they could take a $|G|$tuple of booleans, if that's easier). The functions return a real result. I want to minimize over $S$ the average value of ... |
Does anyone have any advice about how I can fast track my understanding of what these types of algorithms mean:
http://en.wikipedia.org/wiki/Monad_(category_theory)
I don't want to have to sit 3 years of maths but is there anything I can do for this to make more sense?
|
In the case of unlabeled graphs, the graph isomorphism problem can be tackled by a number of algorithms which perform very well in practice. That is, although the worst case running time is exponential, one usually has a polynomial running time.
I was hoping that the situation is similar in the case of labeled graphs. ... |
Consider the class $L^A$ which contains all the languages that are decided by a deterministic Turing Machine that uses $O(log(n))$ space and that can make queries to an oracle that decides $A$. My question is what is the length of query that the machine can ask the oracle? Is it $O(log(n))$ or can it be polynomial in $... |
I was just researching Fibonacci encoding of integers. Numbers are encoded in binary and where no two consecutive bits are equal to 1 - other than to terminate the number.
Now other schemes are possible, for example having three or more 1's terminating the number. These representations are more efficient (shorter) for ... |
I am suppose to create a minimum spanning tree from this graph below
I got this answer
However this is my textbook answer
Based on what i have learnt , I think my answer and the textbook answer would both be acceptable however I would like assurance from the community that both the answers are acceptable and I did n... |
Suppose, to the contrary, that there exists a computable algorithm for some undecidable decision problem. Would this mean that halting problem would be solved by a computable algorithm? I know that the converse is true for a decision problem in RE complexity class, but not for the other way around.
|
The problem
Prove that the language
$\qquad L = \{a^n b^j \mid n = j^2\}$
is not context free using pumping lemma.
Approach taken by the book
To prove such statements, the book takes the approach of a game played against an opponent who strives to fail our effort to prove that the language is not context free. The ste... |
I want to calculate the edit distance (aka Levenshtein-Distance) between two words: «solo» and «oslo».
According to this site we'll get the result matrix:
What I don't understand is: In case of comparison the last «o» from «solo» with the first «o» of «oslo» will see the submatrix:
3 2
4 3
As far as I understand, i... |
So I was thinking about how to computationally (e.g., with recursion) obtain the number of tilings of an $m \times n$ board with $2 \times 1$ dominoes. If $m \leq n$, then we can use recursion on $n$ by keeping track of the which squares are filled in the $n$th column, which gives $2^m$ cases to keep track of for each ... |
This is a PDA from the lecture slides I'm using:
They say it accepts all words that contain double a's. While it makes some sense it's not full proof.
What prevents the second a to be read in the left branch not the right? Or even a 3rd..4th a and so on? Is that the case of human Intervention like needed in PDA for o... |
Please excuse my ignorance in low level things. A lot of the written below might be very wrong.
As far as I understand (and I might be very wrong), there are two types of memory locations a microprocessor can have: registers and stacks.
My question is what is the most basic set of memory locatiins a microprocessor must... |
This is a generalization of another question I posted because I wasn't clear that I cared about more than $2 \times 1$ dominoes (it's just a special case), and there is an explicit tractable formula for $2 \times 1$ dominoes. I was wondering about how to computationally (e.g., with recursion) obtain the number of tilin... |
Shannon's entropy measures the information content by means of probability. Is it the information content or the information that increases or decreases with entropy? Increase in entropy means that we are more uncertain about what will happen next.
What I would like to know is if entropy increases, does this mean th... |
I have a set of related data/objects for which, when undergoing some algorithm, there should be only one valid match. Is there a unique term for this type of set?
A common practical use case would be a list displayed for user selection, or a list of keys that should have a single corresponding entry in a database table... |
So for an arbitrary $n^2 \times n^2$ Sudoku puzzle, there are rules for inferring values and auxillary information in cells that run in polynomial time, e.g. using the filled in values to check to see if only one number is possible for a cell, using the filled in values to check if only one cell in a given row/column/s... |
So I have a graph and need to find shortest path between two points in it. I need1 to do it it using bidirectional search. The bidirectional search should be goal-directed, i.e. A*.
So let $l(u,v)$ be length of the (oriented) edge $u,v$, $\pi_f(v)$ the potential of vertex $v$ in forward search and $\pi_r(v)$ potential ... |
In his "Types and Programming Languages", Pierce, at the very end, presents the most powerful system in the book: $F^{\omega}_{<:}$. He, however, does not explain how bounded existential polymorphism would work. I could not find a reference to this online anywhere. Is this just not possible or just not very interesting... |
I have trouble understanding my text-book on how to convert a DFA to a Regular Expression using "equation-method"(don't no what it's called).
If someone could explain step by step in detail what's going on it would be great(or maybe a few steps to get me going). (Old exam-task)
I have this DFA:
And the solution is:
I... |
Dynamical systems are those whose evolution can be described by a rule, evolves with time and is deterministic. In this context can I say that Neural networks have a rule of evolution which is the activation function $f(\text{sum of product of weights and features})$ ?
Are neural networks
dynamical systems,
linear ... |
Continuing on the theme from my last question Variable Length Encoding of Integers, I have come up with a simple encoding scheme, but for which an efficient algorithm eludes me.
The constraints are simple enough: no (binary representation) number is allowed where it is divisible by 3, or a subset (prefix) of that repre... |
How to decode gamma code ($\gamma$ code):
1110001110101011111101101111011
and get the gap sequence?
Detailed information about Gamma codes ($\gamma$ codes) with a brief example of decoding can be found here.
But in their example there is only one case when gamma code ($\gamma$ code) consists of one digit only, how t... |
An ISP has following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20
The ISP wants to give half of this chunk addresses to Organization A,
and a quarter to Organization B, while retaining the remaining with itself.
Which of the following is a valid allocation of addresses to A and B?
A) 245.248.13... |
So, it's known that PCP is undecidable even when we fix the number of tiles to $n \geq 7$.
I'm wondering, can anything similar be said for when there is a fixed word length?
To be precise, here's the problem:
Given fixed $m$ and $n$, with $n \geq 7$, and words
$u_1, \ldots u_n$ and $v_1 \ldots v_n$ such that $|u_i|... |
I came across the following in a text book:
Frequency distribution – Given a set of n items, which element occurs the largest number of times in the set? If the items are sorted, we can sweep from left to right and count them, since all identical items will be lumped together during sorting.
To find out how often an... |
I would like to know what a state variable is in simple words, and I need to give a lecture about it.
I have chosen the Longest Common Subsequence problem
I found a similar question but it has no answers. I was told that I need to use the "states of variables" (not sure if variable of a state and state variable are th... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.