Category: Uncategorized

Problem Detail: hope it’s possible for this question to be answered in an objective manner. I’m not studying in a liberal arts college so basically I only get to study one subject. Which would be the better preparation for future research Read More …

Problem Detail: Generally (perhaps always) in programming languages, unary operators have the highest precedence. In some langauges, such as Standard ML, one can dynamically change the precedence of binary operators at run time. But what if we have a language where Read More …

Problem Detail: I have labeled examples coming in on the fly, thus I need to create a classifier from sequential data instead of a static example set. Incoming data is fully labeled, there are no unlabeled examples. Each incoming example has Read More …

Problem Detail: In Chaitin’s Meta Math! The Quest For Omega, he briefly talks about Hilbert’s 10th Problem. He then says that any Diophantine Equation $p=0$ can be changed into two equal polynomials with positive integer coefficients: $p=0 iff p_1 = p_2$. Read More …

Problem Detail: Suppose we want to join two relations on a predicate. Is this in NC? I realize that a proof of it not being in NC would amount to a proof that $Pnot=NC$, so I’d accept evidence of it being Read More …

Problem Detail: I didn’t know how to ask this question before but now that I’m reading about typed lambda calculus I think I’ve got a better idea. There is this answer to a question asking whether CSS is Turing complete or Read More …

Problem Detail: Reading this http://classes.soe.ucsc.edu/cmps102/Spring10/lect/17/SAT-3SAT-and-other-red.pdf, I came to know that reducing a clause $C_i$ from a $SAT$ instance containing more than 3 literals to a $3-SAT$ instance is done this way, Suppose $C_1$ is ${x_1, x_2, x_3, x_4}$. It’s equivalent representation Read More …

Problem Detail: I think about unary languages $L_k$, where $L_k$ is set of all words which length is the sum of $k$ squares. Formally: $$L_k={a^nmid n=sum_{i=1}^k {n_i}^2,;;n_iinmathbb{N_0};(1le ile k)} $$ It is easy to show that $L_1={a^{n^2}mid ninmathbb{N_0}}$ is not regular Read More …

Problem Detail: Is there any NP-hard problem that we can find a mechanical “polynomial time” solution to? For example, suppose we construct a graph out of something physical, e.g. we have have pipes through which we can move water. If this Read More …