A Turing machine can enumerate all the decimal numbers, produce 0, or the successor of any number. ... Isn't induction defined by a Turing machine? -- i.e., the finite representation of an infinite process. So numbers are transition tables along with the universal Turing Machine. ... [Conversely,] any representation of the transition tables for a universal Turing machine is a number. A number is a program for a computer. ... Any program is a transition table for a universal Turing Machine.
Google-1
Google-2
personal notes