A function composition of several non-degenerate functions could lead to better coverage of a larger domain. I thought that's what you were suggesting? Characterizing those hypothetical non-degenerate functions seems impossible to me if there are not repeated measurements across observers. My objection to Dave's objection about the unfair accusation of Not Real things has to do with having just one observer. They are not real AND not well characterized. Understanding what a composition will do at least requires modeling the pieces of the composition. At least consult your shaman to clarify your feelings!
-----Original Message----- From: Friam <[email protected]> On Behalf Of ? glen Sent: Thursday, March 24, 2022 3:44 PM To: The Friday Morning Applied Complexity Coffee Group <[email protected]> Subject: Re: [FRIAM] Birds do it, monads and their algebras do it... It sounds to me like you're asserting that everything is special and nothing is generalized. I use 'generalized' instead of 'general' or 'generalizablity' because one of the biggest stimulants of *my* social relationships is the arguments that ensue from the assumption of generalizability. It's almost like those of us who argue for general constructs *want* the world to die ... look forward to the heat death, where all of us agree and there's no work left to be done. On March 24, 2022 3:21:58 PM PDT, Jon Zingale <[email protected]> wrote: >General truths are beautiful things, but too often they could not be >further from the whole story. It is wonderful that every computation >under the sun can be computed by a universal Turing machine, but at the >end of the day, no one is closer to knowing how best to program one for >all occasions, no closer to a free lunch. > >By what procedure should one set out to discover an optimal search, to >search among stars for the perfect search. A zoo of computational >complexities point to the problem, and never before have we come so >close to a general truth about the enormity of our problems. > >https://complexityzoo.net/Complexity_Zoo >https://en.wikipedia.org/wiki/No_free_lunch_theorem >https://en.wikipedia.org/wiki/Turing_machine -- glen ⛧ .-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn UTC-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: 5/2017 thru present https://redfish.com/pipermail/friam_redfish.com/ 1/2003 thru 6/2021 http://friam.383.s1.nabble.com/ .-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn UTC-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: 5/2017 thru present https://redfish.com/pipermail/friam_redfish.com/ 1/2003 thru 6/2021 http://friam.383.s1.nabble.com/
