This is the series in which I presented the proofs that Perl parsing is not, in general, decidable. The articles assume a basic knowledge of Perl, but no familiarity with proofs, Theory of Computation, the Halting Problem, or any of that. They appeared in successive issues of The Perl Review.
Part 1: "The Halting Problem", in The Perl Review, Volume 4, Issue 2, Spring 2008, pp. 21-25. Download. Revisions and Corrections.
Part 2: "Rice's Theorem", in The Perl Review, Volume 4, Issue 3, Summer 2008, pp. 23-29. Download. Revisions and Corrections.
Part 3: "Perl Is Undecidable", in The Perl Review, Volume 5, Issue 0, Fall 2008, pp. 7-11. Download.
These pages are licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License