|
|
Re: The computable reals are uncountable (?)
Posted:
Jun 4, 2012 10:16 AM
|
|
On Sun, 3 Jun 2012 11:49:55 -0700 (PDT), Marshall
<marshall.spight@gmail.com> wrote:
>On Sunday, June 3, 2012 10:01:22 AM UTC-7, LudovicoVan wrote:
>> "David C. Ullrich" <ullrich@math.okstate.edu> wrote in message
>> >
>> > Invent a programming language for a universal TM. The
>> > programs are finite strings in a finite alphabet, so there
>> > are only countably many programs.
>>
>> But not every finite string is a valid TM.
>
>That depends on the programming language. It is possible
>to construct a programming language such that ever possible
>string is a valid program. (These languages are not generally
>of much direct use to humans.)
True, but a much better answer is that the fact that in some
other language not every string is a valid program is
totally irrelevant.
>
>
>Marshall
|
|
