random

David C. Ullrich ullrich at math.okstate.edu
Wed Jun 6 17:19:36 CEST 2001


On Tue, 05 Jun 2001 20:42:47 GMT, wtanksle at dolphin.openprojects.net
(William Tanksley) wrote:

>On Tue, 05 Jun 2001 15:09:25 GMT, David C. Ullrich wrote:
>>But this question is not meant to be rhetorical: We have a syntax where
>>the valid programs are exactly finite sequences of 0's terminated by a 1.
>>Does this count as "self-delimiting"?
>
>Yes, but I don't think it counts as a UTM program.  There are only
>countably many possible programs for this machine, while a UTM can run
>uncountably many.

Um. Some of these "programs" have infinite length, then? If they
all have finite length then there's only countably many - that's
even if the length is unbounded. If a UTM actually runs programs
of infinite length then fine, but I can't imagine what it means
to run such a program.

>>David C. Ullrich
>
>-- 
>-William "Billy" Tanksley



David C. Ullrich
*********************
"Sometimes you can have access violations all the 
time and the program still works." (Michael Caracena, 
comp.lang.pascal.delphi.misc 5/1/01)



More information about the Python-list mailing list