<html style="direction: ltr;">
<head>
<meta content="text/html; charset=utf-8" http-equiv="Content-Type">
<style type="text/css">body p { margin-bottom: 0.2cm; margin-top: 0pt; } </style>
</head>
<body style="direction: ltr;" bidimailui-charset-is-forced="true"
bgcolor="#FFFFFF" text="#000000">
<div class="moz-cite-prefix">On 29/01/15 15:37, Ori Idan wrote:<br>
</div>
<blockquote
cite="mid:CACyhTREvgXHtt0wftmf2RnA888OEeVbjmD5S4WYv+6P2w=iCYw@mail.gmail.com"
type="cite">
<div dir="ltr"><br>
<div class="gmail_extra">
<div class="gmail_quote">
<blockquote class="gmail_quote" style="margin:0 0 0
.8ex;border-left:1px #ccc solid;padding-left:1ex">
<div style="direction:ltr" bgcolor="#FFFFFF"
text="#000000"><span class="">
<blockquote type="cite"> </blockquote>
</span> Didn't you just describe a Turing machine?</div>
</blockquote>
<div>Turing machine is finite and has certain number of
states with defined transitions. I think what Omer meant
here was more of a dynamic Turing machine.</div>
<div><br>
</div>
</div>
</div>
</div>
</blockquote>
Since a Turing machine has an infinite amount of memory, and since
that memory can be used in order to decide on which transitions to
perform, I disagree with your statement that there is a difference.<br>
<br>
After all, each new state that Omer's "FSM" (I'm not sure how you
can call it a Finite state machine, when you do not bound the number
of states it has, hence the quotes) must be describable given a
combination of the initial states and the input. This is, precisely,
how a Turing machine works.<br>
<br>
Shachar<br>
</body>
</html>