Amen. Kudos to LW for choosing function over form for the few cases where we couldn't have both. I'm not entirely certain that "undecidable" from the original node equates to "unparseable" in this one, but anyways...

Isn't FORTRAN undecidable? F66 isn't pretty, but it has certainly proved itself useful over the last 4+ decades.

I had considered doing a full analysis of the proof, but I'm not sure if/when my brain would ever complete that task. I guess it's Just Another Perl Halting_Problem.