277 reputation
111
bio website
location
age
visits member for 2 years, 7 months
seen Dec 5 at 18:53

Jul
2
awarded  Curious
Apr
8
awarded  Critic
Jan
30
awarded  Popular Question
Dec
9
awarded  Nice Answer
Jul
25
accepted Computing the inverse Jacobi function $\mathrm{arccd}$ with elliptic integrals
Jul
25
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).
Jul
25
asked Computing the inverse Jacobi function $\mathrm{arccd}$ with elliptic integrals
Jun
7
revised Conditioning on a Discrete Random Variable
fixed LaTeX typo "\lambd>\lambda"
Jun
7
suggested approved edit on Conditioning on a Discrete Random Variable
May
24
awarded  Yearling
Apr
21
accepted Centroid of a semicircle vs. a semicircular arc
Apr
20
asked Centroid of a semicircle vs. a semicircular arc
Apr
9
revised What was the first bit of mathematics that made you realize that math is beautiful? (For children's book)
added 198 characters in body
Apr
1
comment Why is propositional logic not Turing complete?
Thank you for the detailed answer. By feedback you mean sequential circuits, right?
Apr
1
accepted Why is propositional logic not Turing complete?
Apr
1
awarded  Commentator
Apr
1
revised Why is propositional logic not Turing complete?
added 68 characters in body
Apr
1
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.
Apr
1
asked Why is propositional logic not Turing complete?
Mar
25
accepted Calculating a derivative from a Maclaurin series