# All Questions

2 views

### How to translate the axiom schema of induction by Haskell-Curry?

I'm trying to understand the Haskell-Curry correspondence. I am comfortable with it for propositional logic, but get confused when $\forall, \exists$ quantifiers come in the picture. The axiom schema ...
9 views

### Vanishing gradient in RNNs - yes or no?

One of the often cited issues in RNN training is the vanishing gradient problem (Y.Bengio et al. doi:10.1109/72.279181), (S.Hochreiter doi:10.1142/S0218488598000094), S.Hochreiter et al., (R.Pascanu ...
14 views

26 views

### Solving the following recursions using the Akra-Bazzi theorem [closed]

Can the following equations be solved using the Akra-Bazzi theorem and how? Also - I don't quite understand the h_i(x) part of the Akra-Bazzi theorem in Wikipedia. I'll appreciate an explanation. ...
385 views

### Is this behavior in a programming language inconsistent?

I'm developing a tiny programming language to try to wrap my head around type inference, and I'm trying to figure out if its behavior makes sense or not. Here's the problem: The identity function ...
29 views

### Sparse matrix-vector multiplication materials needed

I've been assigned a project at school, the theme is the influence on cache memory when doing sparse matrix-vector multiplications. I've been searching for materials for quite some time but all I can ...
52 views

### About the position of side conditions in an inference rule

Sometimes I see people put side conditions above the inference line as if they were premises of an inference rule. This feels strange. My understanding (which may be wrong) is that a side condition ...
307 views

### The randomized query complexity of the conjoined trees problem

An important 2003 paper by Childs et al. introduced the "conjoined trees problem": a problem admitting an exponential quantum speedup that's unlike just about any other such problem that we know of. ...
### Examples of $2^{\Theta(n^2)}\text{poly}(n)$-time algorithms
What are notable examples of problems for which the best currently known algorithm has $2^{\Theta(n^2)}\text{poly}(n)$ running time ?