Hypercube
Reputation
289
Top tag
Next privilege 500 Rep.
Access review queues
 Jul25 comment Computing the inverse Jacobi function $\mathrm{arccd}$ with elliptic integrals I get $a=1.6859350333 + 0.763854942178i$ using $F_2\left(\arcsin\left(\sqrt{\frac{1 - x^2}{1 - mx^2}}\right)\bigg| m\right)$. Maple uses a different parameter however; see math.stackexchange.com/questions/375110/…. Also, the inverse Jacobi functions are multivalued (dlmf.nist.gov/22.15). Apr1 comment Why is propositional logic not Turing complete? Thank you for the detailed answer. By feedback you mean sequential circuits, right? Apr1 comment Why is propositional logic not Turing complete? I've heard about this, but they can be considered to be Turing complete for practical purposes, correct? In that they can perform any computation that a Turing machine can up to a memory limit. Mar25 comment Calculating a derivative from a Maclaurin series What do you mean? The terms for $n=1$, $n=3$, $n=5$, etc. are not zero. Mar25 comment Calculating a derivative from a Maclaurin series I'm still not sure why having $2n$ in the exponent makes it the $2n$th term. When did it switch from being the $n$th to the $2n$th? Mar25 comment Calculating a derivative from a Maclaurin series Thank you. This works, but why? Isn't the $n$th term of a Maclaurin series always $\frac{f^{(n)}(0)\;x^n}{n!}$? Oct21 comment Benford's law with random integers Yes, I meant as the lower bound goes to infinity. Thank you! Oct21 comment Benford's law with random integers What do you mean? Wouldn't it approach Bentford's law? Jun11 comment Why is $\log_{-2}{4}$ complex? Thank you! I'll look more into this. Jun11 comment Why is $\log_{-2}{4}$ complex? Thank you, that makes sense. May24 comment Combinations and Gaussian function Thanks for the explanation; it's very accessible. May24 comment Combinations and Gaussian function That's interesting. I'll have to look more into it.