In article <firstname.lastname@example.org>, Keith Ramsay <email@example.com> wrote:
>John Baez wrote:
>|I believe that for every countably infinite ordinal X below >|the Church-Turing ordinal, there's a enumeration of X such >|that the order relation on X becomes a recursive relation on X. >|Is this right?
>I assume the Church-Turing ordinal is the same as the one >often known as the Church-Kleene ordinal.
Sorry! I seem to have a Pavlovian tendency to write "Turing" when I see "Church-". I've made that mistake several times. I see now it led me into learning about Turing's thesis work with Church on "Systems of logic defined by ordinals". When I heard about this, I assumed it dealt with the "Church-Turing ordinal". I should have been saying "Church-Kleene ordinal" all along. I'll fix "week236".