Noncomputability proof in twitter-size format--just posted this on i-dont-like-ai at bluesky & mastodon
GOEDEL INCOMPLETENESS: There are infinitely many programs that can't be analyzed by a computer program. Proof. Suppose A[b, c] is a program that gives a boolean True if program b[c] ever exits, and False if not. Let D[e] be { if (A[D, e]) {while {e==e} do { } } } Eg, A[D, 1] is noncomputable















