tag:blogger.com,1999:blog-31044001.post2381438542934629646..comments2018-02-12T10:14:55.339-08:00Comments on benjaminFRY: Rust and the most elegant FSMBenjamin Frynoreply@blogger.comBlogger7125tag:blogger.com,1999:blog-31044001.post-81364050280663136872017-02-20T23:53:24.617-08:002017-02-20T23:53:24.617-08:00Keep sharing. valet parking lutonKeep sharing. <a href="http://www.swiftairportparking.co.uk/meet-and-greet.php" rel="nofollow">valet parking luton</a>Brooke Higginshttps://www.blogger.com/profile/17932014793414268026noreply@blogger.comtag:blogger.com,1999:blog-31044001.post-64471942001103984132017-02-15T22:44:32.820-08:002017-02-15T22:44:32.820-08:00Nice post. Heathrow Terminal 1 ParkingNice post. <a href="http://www.bestmeetandgreetheathrow.co.uk/terminals" rel="nofollow">Heathrow Terminal 1 Parking</a>SabrinaGreenhttps://www.blogger.com/profile/07875382196014043549noreply@blogger.comtag:blogger.com,1999:blog-31044001.post-90487720418196011092015-08-19T21:52:59.505-07:002015-08-19T21:52:59.505-07:00It's been a long time since my automata theory...It's been a long time since my automata theory course as well, so Dan's comment made me want to refresh my memory. This page of CS notes makes the fundamental difference between finite state automata and Turing machines pretty clear: http://www.cs.hmc.edu/~keller/cs60book/12%20Finite-State%20Machines.pdf<br /><br />The difference is not so much in the way you define the transition function, but in how that function interacts with input and output. Of course those differences change the sort of transition functions you construct, but it's interesting to see where they're similar and where they're different.Levihttps://www.blogger.com/profile/04476780020206011963noreply@blogger.comtag:blogger.com,1999:blog-31044001.post-82796477823098455672015-08-19T10:10:11.049-07:002015-08-19T10:10:11.049-07:00Turing Machines have an infinite tape (given memor...Turing Machines have an infinite tape (given memory constraints), but the states are finite. Though, I won't argue the point, b/c this is based on my education from 15 years ago, and I don't care much about the theory, just the usefulness. Happy to change that line if people nitpick ;)Benjamin Fryhttps://www.blogger.com/profile/04520536023463927850noreply@blogger.comtag:blogger.com,1999:blog-31044001.post-78791093644436119442015-08-17T18:57:43.377-07:002015-08-17T18:57:43.377-07:00Umm... a turing machine isn't a finite state m...Umm... a turing machine isn't a finite state machine. The state in a turing machine isn't limited to a finite set of states.Dan Chttps://www.blogger.com/profile/08601091301529419341noreply@blogger.comtag:blogger.com,1999:blog-31044001.post-69469110241426351672015-08-14T13:58:28.160-07:002015-08-14T13:58:28.160-07:00Sorry, I posted the previous comment from my phone...Sorry, I posted the previous comment from my phone and I deleted the first line without noticing.<br /><br />It should have said something to the effect of:<br /><br />I'm not sure exactly why they chose 'enum', but it could be because when you define a new type with it,<br /><br />Levihttps://www.blogger.com/profile/04476780020206011963noreply@blogger.comtag:blogger.com,1999:blog-31044001.post-60586987915089199652015-08-14T13:13:38.082-07:002015-08-14T13:13:38.082-07:00a new type with it, you enumerate all the values t... a new type with it, you enumerate all the values that inhabit it. This is opposed to struct/tuple type definitions where you are describing a type inhabited by the Cartesian product of its constituent types' inhabitants.<br /><br />It's probably also meant to be reminiscent of C, Java, etc syntax, but I am not sure the familiarity is worth the possible confusion over the differences!Levihttps://www.blogger.com/profile/04476780020206011963noreply@blogger.com