Turing, Undecidability, Adaptation and Cancer

Donald Knuth wrote in his Fundamental Algorithms that any piece of code over 1000 lines of code would be impossible to debug completely.

Daedelus Kite

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.

View original post

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

%d bloggers like this: