instruction stringlengths 35 29.1k |
|---|
In some books and on the internet I occasionally find "pure binary" and "binary" on its own, is there a difference between these two terms? If so, can someone describe briefly what they are?
|
We are given a graph G, integer b < |E|, and subset F in E. The problem is to detect whether there is a cycle in the graph with length at most b and includes each edge in F. Prove that this is NP Complete.
I'm thinking of reducing from Hamiltonian Path, but still can't think of the appropriate transformation function.... |
This is NOT HW, this is from Skienas book, and I just couldn't solve it at all.
Please give me a hand here, in understanding and solving it, thanks.
Let G = (V, E) be a binary tree. The distance between two vertices in G is the length of the path connecting these two vertices, and the diameter of G is the maximal dista... |
Ok, I have done a lot of research on Quantum computers. I understand that they are possibly the future of computers and may be commonplace in approximately 30-50 years time.
I know that a Binary is either 0 or 1, but a Qubit can be 0 or 1. But what I don't understand is how it can be anything other then 0 or 1. Surely ... |
As I understand, the assignment problem is in P as the Hungarian algorithm can solve it in polynomial time - O(n3). I also understand that the assignment problem is an integer linear programming problem, but the Wikipedia page states that this is NP-Hard. To me, this implies the assignment problem is in NP-Hard.
But su... |
I am attempting to prove the following problem is undecidable. Given a Turing machine $M$ and input $x$, does $M$ visit infinitely many tape cells on input $x$?
I am considering a reduction from the halting problem. Is this the right approach?
|
I've been trying for a while now to find a solution for the problem in the title: determining if a number is perfect using a Turing Machine. I only had one class on the TM and while I did "get" how it works, this particular algorithm is being really hard for me to develop.
The algorithm I'm trying to implement on the T... |
Basically, I am looking for a (well-defined) term for some "borderline" vertexes interconnecting other vertices in and outside of a given connected component.
More specifically, given directed graph $G = (V_G, E_G)$ and (strongly) connected component $C = (V_C, E_C)$, how do people refer to such vertices $x$, where,
$... |
I have been reading some notes on Category Theory. One question that is posed is to verify the definition of $\operatorname{List}$ is a functor...
$\operatorname{List}(g \circ f) = (\operatorname{List} g) \circ (\operatorname{List} f)$
I can see this makes sense in programming terms whereby a function $f$ is mapped to ... |
First off, I am not sure if this is the correct stackexchange site to ask this question on, so moderators can feel free to move it.
I am working on an application that identifies an object in an image. For example, let's say that the object is an apple, and the apple can be green, red, or both.
My plan is to create an... |
So I'm just starting to learn about query processing and such in databases and I'm having some trouble. I don't really understand how to compute the minimum number of block reads given a relation and a query I guess you could say. If anyone could help me out, it'd be much appreciated. Here is an example that I'm wor... |
I am working over a homework problem and am confused on how to determine whether there is internal and external fragmentation given the following table:
Characteristic Design 1 Design 2 Design 3
Physical Memory Address Width: 8 bit 16 bit 32 bit
Virtual (Logical) Address Width: 12 bit 20 ... |
Setup
I need to develop a Turing Machine that accepts a string m that has the same number of a's and b's.
My alphabet is {a,b}, and we use a diamond in class to represent an empty space.
Problem
The part I'm having trouble with is returning to the beginning of the string.
So far
At first I was planning on taking a char... |
If you have a language L, without doing any proofs, is there a way to tell if it's recognizable or co-recognizable or decidable?
Basically any hints or tricks that can be used to tell. Or maybe the common patterns to search for to tell which kind it is?
|
From Skiena's book The Algorithm Design Manual, chapter 6, problem 22:
Let $G = (V,E,w)$ be a directed weighted graph such that all the weights are positive. Let $v$ and $u$ be two vertices in $G$ and $k \leq |V|$ be an integer. Design an algorithm to find the shortest path from $v$ to $u$ that contains exactly $k$ edg... |
Can you help me with this problem ?
Given an undirected graph $G$ and an integer $n$, prove that determining whether the graph has wheel on $n$ vertices $W_{n}$ (a wheel $W_{i}$ is such that $i$ nodes form a cycle and a $i+1$st node is connected to all other nodes, resulting in $2i$ edges) is NP-complete.
|
For the following question:
If B is an element of PSPACE and A is an element of PSPACE-Complete, and A polynomial reduces to B, then B is an element of PSPACE-Complete.
I am trying to prove this, but I don't understand how to get started. Can anyone help please?
|
Can someone give me a hand here, I am new to backtracking, and preparing for an interview. I couldn't even attempt this question, please help.
Describe a back tracking algorithm for efficiently listing all k-element subsets of n items.
For n = 5 the 3 element subsets are (1,2,3), (1,2,4), (1,2,5), (1,3,4), (1,3,5), (1,... |
Does our PC work as Turing Machine? The model of a Turing Machine consists of infinite memory tape, which means infinite states. But suppose if our PC has 128 MB memory and 30GB disk it would have 256^30128000000 states and thus, it has finite states.
I know that we can write a type of program that, if during executio... |
Consider this problem:
Given an undirected graph $G = (V, E)$, find $G' = (V', E')$ such that:
$G'$ is an induced subgraph of $G$
$G'$ has no 3-cliques
$|V'|$ is maximal
So the least number of vertices must be eliminated from $G$ so that 3-cliques are eliminated.
An equivalent problem would be to find a 2-coloring ... |
I have my end of year exams next Thursday. I'm generally doing fine but I am having some major issues with this strand of my course, this has to be the biggest issue I have. So, here is the question in the past paper:
You have been tasked with determining the validity of a
manufacturer’s claim that their widget i... |
I tried posting this in the math forum but I didn't get any responses. I was hoping someone could give me some advice for how to approach the following problem.
If $n$ is a positive integer, let $S_n$ denote the group of permutations of the set $\{1,2,\dots, n\}$. For a permutation $\pi$ in $S_3$, let $e_\pi$ be the b... |
Prove that context free languages aren't closed under this operation: $ A(L) = \{ zyx \mid x,y,z \in \{0,1 \}^*, xyz \in L \} $
Obviously, we need to find a context free language $L$ such that $A(L)$ isn't context free. Here are some of my failed attempts:
Take the language $ L = \{\ 0^n1^n \mid n \in N \} $ and then (... |
I have the dataset which you can find here, containing many different characteristics of different houses, including their types of heating, or the number of adults and children living in the house. In total there are about 500 records. I want to use an algorithm, that can be trained using the dataset above, in order t... |
How can we prove that $h(x) = g(f(x))$ is a reduction function for $A \leq_m C$,
if $f$ is the reduction function of $A \leq_m B$ and $g$ is the reduction function for $B \leq_m C$
The given Proposition is: $A \leq_m B, B \leq_m C \Rightarrow A \leq_m C$
I was thinking about using $HALT_{TM}$ for A. So on input $\lan... |
I need to construct d-regular expander graph for some small fixed d (like 3 or 4) of n vertices.
What is the easiest method to do this in practice?
Constructing a random d-regular graph, which is proven to be a.a.s. an expander?
I also read about Margulis constructions and Ramanujan graphs that are expanders and a con... |
I have a question, i was trying to reduce 3-SAT to a particular graph problem and i'm not quite sure about a thing i used in the reduction.
In fact the reduction build a bipartite graph, the edge $(x_1,c_1)$ exist if the variable $x_1$ is in the clause number 1, the costs on that edge are dependent on the truthfulness ... |
In my class we just started learning about Turing machines. I think I understand the concept but am unsure how to syntactically solve any problem related to one. I am presented with the problem:
Build a Turing machine accepting $(b + c)^+$$\#a^+$ (Please comment your
code. Any uncommented solutions will not be gr... |
Been stuck on this for a while, would really appreciate some help:
Suppose you are given an array A[1...n] of sorted integers that has been circularly shifted k positions to the right. For example, [35,42,5,15,27,29] is a sorted array that has been circularly shifted k = 2 positions, while [27,29,35,42,5,15] has been... |
I am confused about the Vapnik-Chervonenkis dimension of a linear separator in 3 dimensions.
In three dimensions, a linear separator would be a plane, and the classification model would be "everything on one side of a plane."
It's apparently proved that the VC dimension of linear separators is d+1, so in 3D, its VC d... |
From graph isomorphism, we know that two graphs A and B are isomorphic if there is a permutation matrix P such that
$A = P \times B \times P^{-1}$
So, to solve the problem, if two graphs are isomorphic, we need to find such a permutation matrix P. The problem is believed to be NP (and NP complete for the case of subgr... |
I am trying to solve this problem and I am really struggling.
A monotone boolean formula is a formula in propositional logic where all the literals are positive. For example,
$\qquad (x_1 \lor x_2) \land (x_1 \lor x_3) \land (x_3 \lor x_4 \lor x_5)$
is a monotone boolean function. On the other hand, something like
$\... |
I'm trying to solve this question in order to review for my exam, and this one has got me a bit stumped. From the looks of it, it seems like a fairly straight-forward question, but I can't figure out what steps to begin with.
Let $M$ be a linear-space Turing machine consisting of a single tape. We say $M$ is a linear-... |
Recently, I came across this problem, a variation of towers of hanoi.
Problem statement:
Consider the folowing variation of the well know problem Towers of
Hanoi:
We are given $n$ towers and m disks of sizes $1,2,3,\dots,m$ stacked on some
towers. Your objective is to transfer all the disks to the $k^{\text{th}}$ ... |
If there is a recursive function
$$
f(x) =
\begin{cases}
1 & \text{if $x \notin A$}\\
\text{undefined} & \text{if $x \in A$}\\
\end{cases}
$$
Is there a special name for the class of sets like $A$?
|
What are some problems that are prone to parallelization? When I think about this, the first thing that comes to my mind is matrix multiplication, which yields to faster calculations, meaning you can get speed ups easily. Any other examples like this?
|
Suppose you are given a polynomial-time algorithm for the following problem related to INDEPENDENT SET:
INDEPENDENT SET VALUE
Input: An undirected graph G.
Output:The size of the largest independent set in G (but not the set itself).
Show how you can use this algorithm to solve the INDEPENDENT SET problem in polynomial... |
Is there any data structure that maintain a collection of set (of finite ground set) supporting the following operations? Any sublinear running time will be appreciated?
Init an empty set.
Add an element to a set.
Given two set, report whether they intersect.
|
Were being asked to determine the whether this Turing Machine is decidable or not
"Given a two way, one-tape DTM $M$ whose tape set is $\Gamma=${$a,b,B$} and a string $x\in${$a,b$}*, determine whether $M$ will ever overwrite a symbol $a$ by a symbol $b$ in its computation on input $x$"
I'm not looking for answers, just... |
I saw this term "Glushkov NFA" at http://lambda-the-ultimate.org/node/2064 . Search engines are returning references to articles that use glushkov nfa, but nothing specific about the glushkov nfa itself.
What is Glushkov NFA? How different is it from the NFA created from Thompson Construction?
|
Is the following language context free?
$$L = \{ uxvy \mid u,v,x,y \in \{ 0,1 \}^+, |u| = |v|, u \neq v, |x| = |y|, x \neq y\} $$
As pointed out by sdcvvc, a word in this language can also be described as the concatenation of two words of the same length the hamming distance of which is 2 or greater.
I think it's not ... |
Across my studies I have noticed the following statement in my Subject Guide; namely, that two-layer feed-forward neural networks using the sigmoidal activation function are universal. My question is how are the networks 'universal' and what does 'universal' actually mean in this instance?
Thanks in advance.
|
I'd like to know if I have the right intuition and my answer is headed the correct way.
I am given a function
$ f = \{0, 1\}^* \rightarrow \{0, 1\}^* $ that is computable in space $O(\log n)$ assume that for every $x \in \{0, 1\}^*$, $f$ is length preserving, $|f(x)| = |x|$.
Define
$$L = \left\{ x\#y \mid \ x, y \in ... |
Let's say I have an optimization problem called $k$-foo which asks for a solution of size $k$ minimizing some quality criterion.
Now the corresponding decision problem $foo(M)$ would be: Is there a solution to foo with quality at least $M$ of size $k$.
For problems on one parameter (for example vertex cover) it is obv... |
I am interested in Distributed Algorithms especially in communication in network with failures.
I look for the proof of the following randomized algorithm of communication in network with failures. For me it seems like very general result in the communication, nevertheless I haven’t found the proof yet.
Algorithm: Ini... |
Why do we need to flip the kernel in 2D convolution in the first place?
What's the benefit of this?
So, why can't we leave it unflipped?
http://www.songho.ca/dsp/convolution/convolution2d_example.html
input
kernel
output
"First, flip the kernel, which is the shaded box, in both horizontal and vertical direction"
|
Prove that $L_1$ is regular if $L_2$, $L_1L_2$, $L_2L_1$ are regular.
These are the things that I would use to start.
As $L_1L_2$ is regular, then the homomorphism $h(L_1L_2)$ is regular.
Let $h(L_1) = L_2$ and $h(L_2) = L_1$, then $h(L_1L_2) = L_2L_1$ is regular (we already know that) or $h(L_2) = \epsilon$ and we ge... |
How do you prove that the language of even-lengthed palindromes, i.e.,
$L=\left\{ ww^R \mid w\in \left\lbrace 0,1 \right\}^* \right\}$, can not be accepted by a determinsitc Push-Down-Automaton?
Is there any general way to prove that a context-free language can not be accepted by a deterministic PDA? I mean something l... |
We have well established theory for measuring the information content and randomness of binary strings. Notions such as Shanon entropy and Kolmogorov-complexity were developed for binary strings.
For a binary square matrix, it is not sufficient to just convert the matrix into binary string and measure its information c... |
Famous PPAD class of problems is formally defined by specifying one of its complete problems, known as End-Of-The-Line:
End-Of-The-Line Problem:
$G$ is a (possibly exponentially large) directed graph with no isolated vertices, and with every vertex having at most one predecessor and one successor. $G$ is specified by... |
Given an undirected graph $G=(V,E)$ could we build a tree $T$ that approximates the distances from given vertex $r$ and the total weight, i.e. $\forall x \in V, d_G(r,x) \le d_T(r,x) \le 3 \cdot d_G(r,x)$ and $w(T) \le 3\cdot w(\text{MST}(G))$, where $\text{MST}$ is the minimum spanning tree and $w(\cdot)$ is the weigh... |
How can I prove that $\{0^n 1^{n^2} \mid n \in \mathbb{N}\}$ is not a context free language?
I tried to prove it using the pumping lemma, but I don't know how to deal with the case when $vxy$ contains both $0$ and $1$.
|
I've a couple of questions that I need answers for. What I am looking for here is the outline of the answers. Not necessarily the exact complete answer. I can do that.
The question is that common operating systems provide support for concurrency through processes and threads.
There are differences between processes a... |
I was looking over this question requesting an algorithm to generate all permutations of a given string. A comment in the answer caught my eye:
It might seem that it can take O(n) time per permutation, but if you think about it more carefully, you can prove that it takes only O(n log n) time for all permutations in tot... |
I'm working on a type system with extensible records, similar to ones explained in "A Polymorphic Type System for Extensible Records and Variants - Benedict R. Gaster and Mark P. Jones" and "Extensible records with scoped labels - Daan Leijen",
I already have a working implementation but I followed a completely differe... |
Is there any way to find out how to replace for/if for elementary recursive algorithms? I know that primitive recursive functions cannot basically eliminate "for", but for elementary recursive functions, there must be a way to convert the program into ones that do not have for/if/while and so on (which is elementary re... |
The regular expression $a^{3}b^{+}$ is indeed regular because we can define an automata $M$. But I see that $\mathcal{L} = \{a^{3}b^{n}, n \geq 1\}$ may generate the same strings, but using the pumping lemma with constant $N$ for a substring $\alpha\beta = a^{3}b^{t},|\alpha\beta| \leq N$, let $\alpha = a$ and $\beta =... |
How to solve fractional knapsack in linear time? I found this on Google but don't really understand it.
Choose element $r$ at random from $R$ (set of profit/weight ratios)
Determine
$R_1 = \{ p_i / w_i | p_i / w_i > r, for 1 \leq i \leq n \}, W_1 = \sum_{i \in R_1} w_i$
$R_2 = \{ p_i / w_i | p_i / w_i = r, for 1 \le... |
There is an infinite wall with a hole somewhere, you are placed on that wall at an unknown position. Let the distance between your initial position & the hole be $x$. Find the average distance traveled in terms of $x$ until you find the hole. What's the complexity of this problem in terms of $x$ and how does an algorit... |
Is $L=\{ xyx \mid x,y \in \{a,b\}^* \text {and } |x| \ge 1 \}$ context-free?
If yes, please explain how we can write grammar or create a PDA for it. If not a CFL, then prove it through pumping lemma.
I have tried to apply the pumping lemma with $w = a^nb^naba^nb^n$ as the word in $L$, but without success.
|
I have been studying Artificial Intelligence and I have noticed that the Bayes' rule allows us to infer the posterior probability if a variable. But, my question is, what does the word, or phrase, 'posterior' mean in this context with regard to the Bayes' rule?
|
Master's theorem is shown below,
The recursive function to be solved is shown below,
I understand that a refers to the number of recursive calls in this function (3 in this case). b refers to what the input size is being divided by in each recursive call. Which I believe should be 4.
d refers to the overhead of each ... |
I’m trying to make a Liquid State Machine in python and I already read many articles about it, but still there are many points I don’t understand.
The readout function is a Feed-forward Neural Network, but how is it taught to read out the states? In the echo state network I had a train period when I feed a train signal... |
I’m trying to make a Liquid State Machine in python and I already read many articles about it, but still there are many points I don’t understand.
(I had trouble putting 'LSM's in context to see what it actually is, but looking at PyBrain's feature list and the description of aureservoir I could classify LSM like this:... |
I’m trying to make an Echo State Network (ESN) in Python and althought I already read many articles about it, still there are many points I don’t understand.
(I had trouble putting 'ESN' in context to see what it actually is, but looking at PyBrain's feature list and the description of aureservoir I could classify ESN ... |
If $L = L(M)$ then $L$ is a subset of $L(M)$ and $L(M)$ is a subset of $L$.
Can anyone clarify what does this mean?
|
Would it be possible for a runtime environment to detect infinite loops and subsequently stop the associated process, or would implementing such logic be equivalent to solving the halting problem?
For the purpose of this question, I define an "infinite loop" to mean a series of instructions and associated starting stac... |
How do I show that TQBF $\notin$ SPACE$((\log{n})^4)$? I know that TQBF is PSPACE complete, but is this the right approach?
|
I have developed two existing data structures and I want to see their performances over a certain algorithm. In this case I use Dijkstra's algorithm with binary and Fibonacci heaps. Just to ask, if I have 100 to 1000 number of vertices in the tested sparse digraphs, how many times should I execute my program for a sing... |
Given a recursive function $T(n)=T(a_1\cdot n)+\dots +T(a_k\cdot n)+\Theta(n)$ such that $\forall a_i: 0<a_i<1$, what is the most general thing I can say about the sum of the cost of the nodes at each level of the recursion tree? I've looked at a few, and for the ones I've looked at it's always come out to $(a_1+\dots... |
I read that the Bernstein operator
$$
\mathfrak{B}_f(t) = \sum_{i=0}^n f\left(\frac{i}{n}\right) \; B^n_i(t)
$$
applied to a polynomial $f(x)$ of degree $m \leq n$ with the Bernstein polynomial
$$
B^n_i(t) = \binom{n}{i} \; t^i \; (1-t)^{n-i}
$$
returns a new polynomial also of degree $m$. In other words, the Bernstein... |
I have this recurrence equation:
$T(n) = T(n/4) + T(3n/4) + \mathcal{O}(n)$
$T(1) = 1$
I know that the result is $\mathcal{O}(n \log n)$ but i don't know how to proceed.
|
I have usually been using the Cormen algorithm format to teach some introductory courses in Programming. I mean something like this:
TreeSearch(k,n)
1. if x==NIL or k==x.key
2. return x
3. if k<x.key
4. return TreeSearch(k.left,n)
5. else return TreeSearch(k.right,n)
Actually I have not agree with a couple of ... |
My background came from imperative languages, primarily C, C++, and Python. I picked up Scala, Erlang, and a bit of Haskell a few years later and have since become very interested in functional programming and the formalisms behind it.
I am also interested in concurrent and distributed programming and have been looking... |
WP has an adequate discussion of paging, which I think I understand.. However I am confused by the articles repeated use of the term Page Frame.
I thought frames and pages were different things. Could someone please clarify the difference.
|
What is the difference between dynamic loading and dynamic linking?
Both systems seem to allow shared libraries, but I am struggling to differentiate between them.
|
I'm stuck on this question about context-free languages and was hoping for some clarification.
$\qquad L = \{a^i b^j c^k \mid i=j, i=k\}$
is not context-free. Show that its complement is context-free.
I understand that the complement basically means everything not in $L$, that is $A^* \setminus L$. However, I have n... |
I am doing some work on register machine theory which revolves around a 2-register register machine and attempting to show that it is not possible to compute an upper-bound on the final contents of its two registers on the basis of its program code and initial input, in halting configurations only. I believe this can b... |
I need to determine which complexity class this problem belongs to:
Given a graph $G(V, E)$, two vertices $u$ and $v$ and a natural number $k$, does a path of length $k$ exist between thesee two vertices?
How can I approach this problem to solve it?
|
I have a set of binary vectors where each vector represents one day of occupancy in a house and consists of 48 elements (each element for 30 minutes of the day). Each element can be 1 meaning that house was occupied and 0 for non occupied house.
My task is to predict the next day based on the history of the same days (... |
I was working on proving this one and I've solve one direction as follows :
to prove that $P \subseteq PCP(0,logn)$ I said :
let $M$ be deterministic polynomial TM that accepts $L \in P$ ,we want to show that we can there exists a proof system which consists of prover and deterministic polynomial verifier that have acc... |
By reduction I mean the following:
Problem X linear reduces to problem Y if X can be solved with:
a) Linear number of standard computational steps.
b) Constant calls to subroutine for Y.
If a problem X reduces to a problem Y, is the opposite reduction also possible? Say
X = Given an array tell if all elements a... |
Consider the following statement:
for any $a < b \in \mathbb{N}$, one of the following holds:
$\gcd(a,b) = 1$.
there is a $a < x < b$ such that
$\gcd(a,x) = \gcd(x,b) = 1$.
there are $a < x < y < b$ such that
$\gcd(a,x) = \gcd(x,y) = \gcd(y,b) = 1$.
Is this statement true?
Motivation:
I found a variant of this pro... |
Say $\ell: \{0,1\}^\ast \to \{0,1\}^\ast$ is a one-to-one polynomial-time computable function that preserves length. Consider the language $$L = \Bigl\{v \;\Big|\; \exists u: \bigl(u_1 = 1 ~~\text{and}~~ \ell(u) = v\bigr) \Bigr\}.$$ How do I prove that $L$ is in $\mathsf{NP} \cap \mathsf{coNP}$? Basically, what would a... |
I know that the CIRCUIT VALUE problem is P-complete.
In the CIRCUIT VALUE problem the input is a Boolean circuit together with an input to this circuit, and the answer is the evaluation of the given circuit on the given input.
I wish to know if the problem of evaluating a Boolean formula on a given assignment is also P... |
Question: If $H = \{(G,m)$ $|$ $G$ is a graph with $m$ distinct Hamiltonian cycles $\}$ ($m$ is in binary), prove that $H \in$ polynomial space.
My thoughts: I thought that I could show that $H \in NP$, by which it would automatically follow that $H \in$ polynomial space. By the witness theorem, the $m$ distinct Hamilt... |
I'm coding a few set comparisons and noting their big O's using different algorithms and set implementations. I got to one particular function and I decided that it is $O(max(n,m))$ runtime. Is that the proper way to express this?
|
Interested in learning more about algorithm design in functional programming, I picked up Andrew Bird's Pearls of Functional Algorithm Design. I have experience with a number of programming languages, but my only experience with functional programming is in Scala. I understood that I would have to pick-up Standard ML... |
I use the following scribe to study Pseudorandom Generators.
The most intriguing question for me is how exactly PRG can be used in order to simulate BPP.
Let $A(x,r) \in BPP$, where $x$ is primary input and $r$ - randomness provided by BPP. Instead of $r$ we can provide $A$ with pseudorandom input $G(U_{d(n^c)})$ and ... |
This is what I know:
GBN weakness is the fact that when the window size is too large, the number of packets in the pipeline grows and one packet error causes the retransmition of many packets unnecessarily.
Selective Repeat solves this by acknowleding just the suspicious packets, which sightly makes performance bette... |
I read somewhere that 3SAT can be used to solve Integer Factorization.
If that is true, could someone teach me a simple example of generating the 3SAT by using a small number? Let's say you are given the number 6, then the factors are 2 and 3.
|
I am studying Computer Systems. I have th following question and its answer:
Given the logical address 0xAEF9 (in hexadecimal) with a page size of
256 bytes, what is the page number?
Answer: 0xAE (I found this answer in the web, but I want to know how can I
figure it out myself?
How can I figure out the page numb... |
Suppose one has a couple of .wav files with English spoken words, multiple ones for each word, and for each such set there exists a transcription of their right output, the pronunciation as ascii text.
As far as I know, machine learning neural networks use arrays of floats as input and output, and also internally.
What... |
I have come across the following problem.
You have $N$ registers, numbered $1,2,\dots, N$, each of which can hold an integer value. You
are given the initial values of the registers, which have the property that every number
from $1, \dots, N$ occurs exactly once among the $N$ registers.
Each register has a "reset butt... |
How should I show that ${\sf P}$ is contained in ${\sf NP} \cap {\sf CoNP}$?
I.e., all polynomial time solvable problems and their complements are verifiable in polynomial time.
|
It is well known that the efficiency of randomized algorithms (at least those in BPP and RP) depends on the quality of the random generator used. Perfect random sources are unavailable in practice. Although it is proved that for all $0 < \delta \leq \frac{1}{2}$ the identities BPP = $\delta$-BPP and RP = $\delta$-RP ho... |
Got a final coming up, so I gotta get this concept down.
Given $A= \{(G_1,G_2 \mid G_1$ and $G_2$ are two CFG's and $L(G_1)=L(G_2) \}$.
Is $A$ decidable?
Would it be sufficient to take an undecidable language such as $B= \{x \mid L(M_x)$ is a CFG $ \}$. Then reduce it to A with function $f(x) = G'_{M_x}$?
|
I am studying parsing, i.e. bottom-up parsing. it is said that there some rules which are used by weak precedence grammar. What does weak precedence grammar mean? What about precedence relation?
Any help will be appreciated. If it is possible, could you give an example. Thanks
|
I want to show that non-emptiness of context free language is P-complete. So, I am trying to reduce CVP to this problem by generating grammar from circuit. I consider all type of gates in circuit and I make right production in grammar.
I hope that it is good way to prove that it is P-complete, but I have a problem wit... |
In Chapter 1 of Practical Foundations for Programming Languages, the author mentions that abstract syntax trees are associated with sorts.
Intuitively, sorts are like types, but I'd like to know if they have a precise definition. I'd be glad if some references are provided as well.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.