[FRIAM] The epiphenomenality relation

[⛧ glen]

This sounds like impredicativity, which can be a problem in parallel computation (resulting in deadlock or race). Unimplemented math has no problem with it, though. And I'm guessing that some of the higher order proof assistants find ways around it. A definitional loop seems distinct from iteration. So, no; I don't see a problem with iteration in digital computation. I simply don't think the intelligent design we do when programming is analogous to biological evolution. The former clearly has side effects (epiphenomena). I argue the latter does not.

On November 28, 2021 5:40:31 PM PST, Marcus Daniels <marcus at snoutfarm.com> wrote:
>Glen had said something a while ago implying that (that trivial meaning for) loops were somehow more challenging for digital computers.    I didn’t get it.
>
-- 
glen ⛧