The road to epsilon-zero: Productive programs and well-founded orders

Previously: Ordinal numbers and basic set theory Ordinals as nim-heaps Nim always ends, even with infinite ordinals Infinite Nim as a coin-moving game Coin-moving games without the coins Previously we saw how to interpret the difficult-seeming ordinal as a particular ordering of the set of finite sequences of numbers, revealing what seemed like a scary monster as gentle and straightforward. Now we're going to take a sidetrack into one of my favorite topics, computation with infinite lists. I wrote about this for The Perl Journal in 1997 and then it turned into chapter 6 of Higher-Order Perl and here we are again. Gosh! it just keeps coming back. Like John the Baptist. Infinite lists Suppose you have an infinite set of strings — we'll call this set for the rest of the article — and you want a program to print them all out. Of course the program can't exactly print them all out, because it will only run for a finite amount of time. But there are more and less useful ways for the program…