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.

3 thoughts on “Turing, Undecidability, Adaptation and Cancer

    1. Yes. It is unsurprising. Also: Turing’s solution distilled elements of Gödel’s, I believe, and used a cleverly recursive proof by contradiction.

      Universal debuggers are logically impossible. This pretty much enshrines the inevitability of endless bugs and breaches but there is something deeper regarding logic and entropy in the kernel of this problem. There is a core blind-spot here that in disentangling will complicate this context by orders of magnitude; an intuition…

      Like

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.