<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><meta http-equiv=Content-Type content="text/html; charset=utf-8"><meta name=Generator content="Microsoft Word 15 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
@font-face
{font-family:Verdana;
panose-1:2 11 6 4 3 5 4 4 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0in;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri",sans-serif;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
span.EmailStyle21
{mso-style-type:personal-reply;
font-family:"Calibri",sans-serif;
color:windowtext;}
.MsoChpDefault
{mso-style-type:export-only;
font-family:"Calibri",sans-serif;}
@page WordSection1
{size:8.5in 11.0in;
margin:1.0in 1.0in 1.0in 1.0in;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body lang=EN-US link=blue vlink=purple><div class=WordSection1><p class=MsoNormal>Frank,<o:p></o:p></p><p class=MsoNormal> <o:p></o:p></p><p class=MsoNormal>There are many things that you have experienced that I have not, and vv, but no value is added by calling these “inner.” I can sort of go along with Glen’s gloss on “inside”, but when you metamorphose it to “inner”, I get antsy. <o:p></o:p></p><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal>But I think we have tilled this ground for all it is worth, for the moment. <o:p></o:p></p><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal>Nick <o:p></o:p></p><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal>Nicholas Thompson<o:p></o:p></p><p class=MsoNormal>Emeritus Professor of Ethology and Psychology<o:p></o:p></p><p class=MsoNormal>Clark University<o:p></o:p></p><p class=MsoNormal><a href="mailto:ThompNickSon2@gmail.com"><span style='color:#0563C1'>ThompNickSon2@gmail.com</span></a><o:p></o:p></p><p class=MsoNormal><a href="https://wordpress.clarku.edu/nthompson/"><span style='color:#0563C1'>https://wordpress.clarku.edu/nthompson/</span></a><o:p></o:p></p><p class=MsoNormal> <o:p></o:p></p><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal><o:p> </o:p></p><div style='border:none;border-top:solid #E1E1E1 1.0pt;padding:3.0pt 0in 0in 0in'><p class=MsoNormal><b>From:</b> Friam <friam-bounces@redfish.com> <b>On Behalf Of </b>Frank Wimberly<br><b>Sent:</b> Monday, May 18, 2020 8:02 PM<br><b>To:</b> The Friday Morning Applied Complexity Coffee Group <friam@redfish.com><br><b>Subject:</b> Re: [FRIAM] hidden<o:p></o:p></p></div><p class=MsoNormal><o:p> </o:p></p><div><p class=MsoNormal>Forget covariant tensors (again). There was a beautiful, talented girl in my sixth grade class. She could dance ballet, draw striking pictures, etc. I thought of her occasionally over the decades. When Google search became available I discovered that she was married to a celebrity.<o:p></o:p></p><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal>When you say that my inner life isn't private, Nick, do you mean you could figure out her name given what I've just written? As I think of her face, can you "see" it well enough to recognize her photo?<o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal>I just don't understand what you mean when you question that I have a private inner life.<o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal style='margin-bottom:12.0pt'>Frank<o:p></o:p></p><div><p class=MsoNormal>---<br>Frank C. Wimberly<br>140 Calle Ojo Feliz, <br>Santa Fe, NM 87505<br><br>505 670-9918<br>Santa Fe, NM<o:p></o:p></p></div></div></div><p class=MsoNormal><o:p> </o:p></p><div><div><p class=MsoNormal>On Mon, May 18, 2020, 7:47 PM Jon Zingale <<a href="mailto:jonzingale@gmail.com">jonzingale@gmail.com</a>> wrote:<o:p></o:p></p></div><blockquote style='border:none;border-left:solid #CCCCCC 1.0pt;padding:0in 0in 0in 6.0pt;margin-left:4.8pt;margin-right:0in'><div><div><p class=MsoNormal><span style='font-size:12.0pt;font-family:"Verdana",sans-serif;color:#333333'>Frank, Glen, Nick,</span><span style='font-size:12.0pt;color:#333333'><o:p></o:p></span></p></div><div><p class=MsoNormal><span style='font-size:12.0pt;color:#333333'><o:p> </o:p></span></p></div><div><p class=MsoNormal><span style='font-size:12.0pt;font-family:"Verdana",sans-serif;color:#333333'>Glen writes:</span><span style='font-size:12.0pt;color:#333333'><o:p></o:p></span></p></div><div><p class=MsoNormal><span style='font-size:12.0pt;font-family:"Courier New";color:#333333'>`</span><span style='font-size:10.0pt;font-family:"Courier New";color:black'>... in last week's Zoom, I mentioned to Jon (in response</span><span style='font-size:12.0pt;color:#333333'><o:p></o:p></span></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Courier New";color:black'>to his query to Frank about RSA-encryption::mind) that I</span><span style='font-size:12.0pt;color:#333333'><o:p></o:p></span></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Courier New";color:black'>think homomorphic encryption is a better analogy (to mind).`</span><span style='font-size:12.0pt;color:#333333'><o:p></o:p></span></p></div><div><p class=MsoNormal><span style='font-size:12.0pt;color:#333333'><o:p> </o:p></span></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>Fully homomorphic encryption</span><span style='font-size:12.0pt;font-family:"Verdana",sans-serif'>†</span><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'> was also the metaphor I originally</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>had in mind. In an effort to not complicate matters, I decided to </span><span style='font-family:"Verdana",sans-serif'>focus</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-family:"Verdana",sans-serif'>on the idea</span><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'> of public key encryption more generally. Thank you, Glen</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>for taking it the rest of the way. Because Glen, Nick and I appear to</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>differ on Frank's mind only in that we disagree about the way that</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>Frank's mind is public, I will attempt to switch sides and argue for</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>why his mind may be private.</span><o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>Firstly, while we may only need to know some combination of</span><o:p></o:p></p></div><div><p class=MsoNormal><i><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>transformations</span></i><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'> which will allow us to know his mind, it may</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>be the case that those transformations are not accessible to</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>us. As an example and in analogy to computation, it may be the</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>case that we are not the kind of machines which can recognize</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>the language produced by a mind. While we as observers are</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>able to finite automata our way along observations of Frank,</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>his mind is producing context-free sentences, say. I don't</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>entirely buy this argument, but it also may be defendable.</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>As another example/analogy, we may be attempting to solve</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>a problem analogous to those geometric problems of Greek</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>antiquity</span>††<span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>. It may take a psychological analog to Galois theory</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>before we understand exactly why we can't know Frank's mind.</span><o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>Secondly, it may be that the encryption metaphor should</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>actually be something closer to hashing. A friend of mine</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>once said that <i>rememberings</i> were morphisms between</span><o:p></o:p></p></div><div><p class=MsoNormal><i><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>forgettings</span></i><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>. We are often ok with the idea that memory is</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>lossy, but why not thoughts themselves? Perhaps, at least</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>with regard to what we can observer of Frank, every time</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>Frank thinks of a covariant tensor he is reconstituting</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>something fundamentally different. The <i>remembering</i> is</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>always between different <i>forgettings</i>.</span><o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>Ok, I am not sure I could necessarily defend these thoughts.</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>Further, I am not sure they are necessarily helpful to our</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>conversation. It seemed a good idea to try.</span><o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>On the topic of steganography, I wanted to mention the</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>book <i><a href="https://en.wikipedia.org/wiki/Steganographia" target="_blank">Steganographia</a></i>. I had originally read about it in some</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>part of Neal Stephenson's <i>Baroque Cycle</i>, and it has since</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>found a place in my heart. The book, originally written in</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>1499, is perhaps the oldest text on the subject of cryptography.</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>What is amazing about the book is that it is an example of</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>itself (nod to Nick). The plaintext content of the book is</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>on the subject of magic, but for a reader clever enough to</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>find the </span><span style='font-family:"Verdana",sans-serif'>deciphering key</span> <span style='font-family:"Verdana",sans-serif'>the</span><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'> book is about cryptography.</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>I had found a copy from the 1700's in the rare books library</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>at the University of Texas some years ago. The content was</span><o:p></o:p></p></div><div><p class=MsoNormal><i><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>doubly hidden</span></i><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'> from me as I neither had the deciphering</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>key nor can I read Latin ;)</span><o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal><span style='font-size:10.0pt;font-family:"Verdana",sans-serif;color:black'>Jon</span><o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal><span style='font-family:"Arial",sans-serif'>†:</span><span style='font-family:"Verdana",sans-serif'> If any members of the group would like to form a reading</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-family:"Verdana",sans-serif'>group around Craig Gentry's <a href="https://www.bookdepository.com/Fully-Homomorphic-Encryption-Scheme-Craig-Gentry/9781243663139" target="_blank">thesis on FHE</a>, I would gladly</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-family:"Verdana",sans-serif'>participate.</span><o:p></o:p></p></div><div><p class=MsoNormal>†† <span style='font-family:"Verdana",sans-serif'>While it turned out that the Greek's assumptions about</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-family:"Verdana",sans-serif'>the power of a compass and straightedge were incorrect,</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-family:"Verdana",sans-serif'>work beginning with <a href="https://en.wikipedia.org/wiki/Margherita_Piazzola_Beloch" target="_blank">Margherita Beloch</a> (and culminating</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-family:"Verdana",sans-serif'>with the <a href="https://en.wikipedia.org/wiki/Huzita%E2%80%93Hatori_axioms" target="_blank">Huzita-Hatori</a> axioms) show that origami would</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-family:"Verdana",sans-serif'>have been a more powerful choice!</span><o:p></o:p></p></div></div><p class=MsoNormal>-- --- .-. . .-.. --- -.-. -.- ... -..-. .- .-. . -..-. - .... . -..-. . ... ... . -. - .. .- .-.. -..-. .-- --- .-. -.- . .-. ...<br>FRIAM Applied Complexity Group listserv<br>Zoom Fridays 9:30a-12p Mtn GMT-6 <a href="http://bit.ly/virtualfriam" target="_blank">bit.ly/virtualfriam</a><br>un/subscribe <a href="http://redfish.com/mailman/listinfo/friam_redfish.com" target="_blank">http://redfish.com/mailman/listinfo/friam_redfish.com</a><br>archives: <a href="http://friam.471366.n2.nabble.com/" target="_blank">http://friam.471366.n2.nabble.com/</a><br>FRIAM-COMIC <a href="http://friam-comic.blogspot.com/" target="_blank">http://friam-comic.blogspot.com/</a> <o:p></o:p></p></blockquote></div></div></body></html>