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
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . 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/
