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.

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…

Reblogged this on Stone Security and commented:
Donald Knuth wrote in his Fundamental Algorithms that any piece of code over 1000 lines of code would be impossible to debug completely.

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

LikeLiked by 1 person

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…

LikeLike

Reblogged this on Stone Security and commented:

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

LikeLiked by 1 person