Programming with a Differentiable Forth Interpreter · HackerPapers discussions

Programming with a Differentiable Forth Interpreter — mentioned by kragen

Mon, 01 Aug 2022 05:50:46 GMT

Agreed about the binomial formula, but don't you need induction to prove the binomial theorem? That is, if you have some sort of set that's like the naturals except that Peano's axiom of induction doesn't apply (such as the naturals plus Alberto and Cristina, who are one another's successors) is the binomial theorem necessarily true in it? Agreed about Maclaurin series. I didn't know there existed smooth functions with divergent Taylor series. I don't understand how that happens; if we're looking at term $n$ of the Taylor series around some point $a$, it's $f^{(n)}(a) \frac{(x - a)^n}{n!}$…

Paper and discussion history. A mention is not an endorsement.

Programming with a Differentiable Forth Interpreter — mentioned by twouhm

Mon, 29 Jan 2018 21:24:02 GMT

What do you think of 'Programming with a Differentiable Forth Interpreter'[0] and 'A Neural Forth Abstract Machine'[1]? I don't know if they are related to your work, but both are on my to-read pile. [0]: https://arxiv.org/abs/1605.06640 [1]: http://people.idsia.ch/~rupesh/rnnsymposium2016/files/bosnja...

Paper and discussion history. A mention is not an endorsement.

Programming with a Differentiable Forth Interpreter — HN submission

Sun, 07 Jan 2018 11:05:00 GMT

Programming with a Differentiable Forth Interpreter (2016)

104 points; 23 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Programming with a Differentiable Forth Interpreter — mentioned by sapphireblue

Sun, 31 Jul 2016 16:55:11 GMT

The author proposes a lot of vague ideas in this article (for example "I believe one of the biggest problems is the use of Error Propagation and Gradient Descent") without references or any solid proofs why they are necessary to solve the proposed program (Automate programming using ML?). In fact there is already a lot of solid work just on this subject: * Learning algorithms from examples http://arxiv.org/abs/1511.07275 https://arxiv.org/abs/1410.5401 * Generating source code from natural language description http://arxiv.org/abs/1510.07211 * And, the most closest work to what author…

Paper and discussion history. A mention is not an endorsement.

Programming with a Differentiable Forth Interpreter — mentioned by sapphireblue

Fri, 22 Jul 2016 20:12:54 GMT

There are signs, if you know were to look for them: http://arxiv.org/abs/1510.07211 https://arxiv.org/abs/1410.4615 http://arxiv.org/abs/1605.06640 https://arxiv.org/abs/1410.5401

Paper and discussion history. A mention is not an endorsement.

Programming with a Differentiable Forth Interpreter — mentioned by aab0

Thu, 14 Jul 2016 16:21:28 GMT

So it's just a char-RNN? I was hoping this was using one of the seq2seq frameworks for actually writing code, like https://arxiv.org/abs/1605.06640

Paper and discussion history. A mention is not an endorsement.

Programming with a Differentiable Forth Interpreter — HN submission

Tue, 24 May 2016 22:35:49 GMT

Programming with a Differentiable Forth Interpreter

97 points; 15 discussion replies on HN. Paper and source history. A submission is not an endorsement.