<div dir="auto">Thanks, Glen. That makes sense.<br><br><div data-smartmail="gmail_signature">---<br>Frank C. Wimberly<br>140 Calle Ojo Feliz, <br>Santa Fe, NM 87505<br><br>505 670-9918<br>Santa Fe, NM</div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Wed, Feb 2, 2022, 3:56 PM glen <<a href="mailto:gepropella@gmail.com">gepropella@gmail.com</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">r.e. is "recursively enumerable", IIRC.<br>
<br>
On 2/2/22 13:34, Frank Wimberly wrote:<br>
> I wonder what an e. r. relation is. Equivalence relations are reflexive by definition.<br>
<br>
-- <br>
glen<br>
Theorem 3. If f(x) is a continuous function of period 2\u03c0, then f(x,r)\u2192f(x) as r\u21921, uniformly \u2200x.<br>
<br>
<br>
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - .<br>
FRIAM Applied Complexity Group listserv<br>
Zoom Fridays 9:30a-12p Mtn UTC-6 <a href="http://bit.ly/virtualfriam" rel="noreferrer noreferrer" target="_blank">bit.ly/virtualfriam</a><br>
un/subscribe <a href="http://redfish.com/mailman/listinfo/friam_redfish.com" rel="noreferrer noreferrer" target="_blank">http://redfish.com/mailman/listinfo/friam_redfish.com</a><br>
FRIAM-COMIC <a href="http://friam-comic.blogspot.com/" rel="noreferrer noreferrer" target="_blank">http://friam-comic.blogspot.com/</a><br>
archives:<br>
5/2017 thru present <a href="https://redfish.com/pipermail/friam_redfish.com/" rel="noreferrer noreferrer" target="_blank">https://redfish.com/pipermail/friam_redfish.com/</a><br>
1/2003 thru 6/2021 <a href="http://friam.383.s1.nabble.com/" rel="noreferrer noreferrer" target="_blank">http://friam.383.s1.nabble.com/</a><br>
</blockquote></div>