From a24d26ee19831f3fb10b7d78d76a7e0dcc5a510b Mon Sep 17 00:00:00 2001 From: Yuchen Pei Date: Fri, 11 May 2018 15:48:59 +0200 Subject: minor edit - added link to permalink of a previous micropost --- microposts/rnn-fsm.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'microposts/rnn-fsm.md') diff --git a/microposts/rnn-fsm.md b/microposts/rnn-fsm.md index 567063d..a1e1315 100644 --- a/microposts/rnn-fsm.md +++ b/microposts/rnn-fsm.md @@ -3,7 +3,7 @@ date: 2018-05-11 --- ### Some notes on RNN, FSM / FA, TM and UTM -Related to a previous micropost. +Related to [a previous micropost](#neural-turing-machine). [The slides from Toronto](http://www.cs.toronto.edu/~rgrosse/csc321/lec9.pdf) is a nice introduction to RNN (recurrent neural network) from a computational point of view. It states that RNN can simulate any FSM (finite state machine, a.k.a. finite automata abbr. FA) with a toy example computing the parity of a binary string. -- cgit v1.2.3