Alan Turing’s proof of the undecidability of non-trivially sophisticated algorithms is sufficient reason for:• the autonomously adaptive, complex information strategies of life; and,• the intractably problematic and recursively non-terminating information transcription of cancer.
Tag: Halting Problem
If a non-trivially complex organisational system of any kind or scale is to be considered (even notionally) as complete or entirely self-consistent, it can not also be adaptive, flexible and resilient.
Daedelus Kite 