<div dir="ltr"><div class="gmail_default" style="font-family:arial,helvetica,sans-serif;font-size:small;color:#000000">Glen,</div><div class="gmail_default" style="font-family:arial,helvetica,sans-serif;font-size:small;color:#000000"><br></div><div class="gmail_default" style="font-family:arial,helvetica,sans-serif;font-size:small;color:#000000">That's a fairly complex model. Would you be willing to present some concrete examples of how it might work? I would find that useful in attempting to understand it.</div><div class="gmail_default" style="font-family:arial,helvetica,sans-serif;font-size:small;color:#000000"><br></div><div class="gmail_default" style="font-family:arial,helvetica,sans-serif;font-size:small;color:#000000">Thanks.</div><div><div dir="ltr" class="gmail_signature" data-smartmail="gmail_signature"><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><font><u style="color:rgb(33,33,33);font-family:"Helvetica Neue",Helvetica,Arial,sans-serif;font-size:16.5px;line-height:20px"><br></u></font></div><div dir="ltr"><font><u style="color:rgb(33,33,33);font-family:"Helvetica Neue",Helvetica,Arial,sans-serif;font-size:16.5px;line-height:20px"> </u></font><span style="color:rgb(33,33,33);font-family:"Helvetica Neue",Helvetica,Arial,sans-serif;font-size:16.5px;line-height:24.75px"> </span>-- Russ Abbott <br>Professor, Computer Science<br>California State University, Los Angeles<br></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div><br></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Thu, Jun 18, 2020 at 10:37 AM ∄ uǝlƃ <<a href="mailto:gepropella@gmail.com">gepropella@gmail.com</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">To restate it, the mechanism consists of:<br>
<br>
• a mesh of parallel processes evolving in time<br>
• each process has a local branching structure for what might happen next<br>
• these branches (and the events that walk them) compose<br>
• that composition is monitored and remembered within some scope<br>
• that monitor/memory is used by a controller to edit the branching structures<br>
<br>
What we call "free will" is the extent to which, and perhaps the *shape* of, the branching structure(s) change over time. It's infeasible to measure the branching structures directly, especially 10 years later trying to decide if your mom's an alcoholic or not. But we can estimate the wiggle in the composite behavior over time and retro-infer whatever branching structure monitoring, remembering, and editing might have taken place.<br>
<br>
I think to adequately falsify this mechanism, we could implement a few (several would be better) versions of it, sweep their parameters and classify the results. If none of them exhibit clear components and some kind of *sensitivity* in one or more parameters, then the basic mechanism can't generate the phenomena we're looking for.<br>
<br>
I think the most important parameters would be the scope of the composer (which processes to include and which to truncate), the fidelity of the monitor, the size of the memory, and the kind of edits (point mutations or something more drastic). It would be validating (and pretty cool) if, say, with a memory size N, entrainment happens quickly, but with memory size N+M, the system flips between 2 behavior/output components. But finding something like that would be a negative result. We'd merely have programmed in the behavior we *wanted* to see come out.<br>
<br>
And it would be interesting to include stochasticity peppered throughout to see if that had an effect on the sensitivity or robustness of the output components.<br>
<br>
-- <br>
☣ uǝlƃ<br>
<br>
- .... . -..-. . -. -.. -..-. .. ... -..-. .... . .-. .<br>
FRIAM Applied Complexity Group listserv<br>
Zoom Fridays 9:30a-12p Mtn GMT-6 <a href="http://bit.ly/virtualfriam" rel="noreferrer" target="_blank">bit.ly/virtualfriam</a><br>
un/subscribe <a href="http://redfish.com/mailman/listinfo/friam_redfish.com" rel="noreferrer" target="_blank">http://redfish.com/mailman/listinfo/friam_redfish.com</a><br>
archives: <a href="http://friam.471366.n2.nabble.com/FRIAM-COMIC" rel="noreferrer" target="_blank">http://friam.471366.n2.nabble.com/<br>
FRIAM-COMIC</a> <a href="http://friam-comic.blogspot.com/" rel="noreferrer" target="_blank">http://friam-comic.blogspot.com/</a> <br>
</blockquote></div>