On Wed, Jun 07, 2006 at 03:56:32PM +0200, Quentin Anciaux wrote:
> 
> Hi Bruno,
> 
> what I undestand about the UD is that it generates all programs, a program 
> being simply a number from the set N.(1)

No - halting programs are a subset of N, but there are uncountably
infinite non-halting ones.

(Assuming we identify all programs without taking the non-read bits
into account).

-- 
----------------------------------------------------------------------------
A/Prof Russell Standish                  Phone 8308 3119 (mobile)
Mathematics                                    0425 253119 (")
UNSW SYDNEY 2052                         [EMAIL PROTECTED]             
Australia                                http://parallel.hpc.unsw.edu.au/rks
            International prefix  +612, Interstate prefix 02
----------------------------------------------------------------------------

--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Everything List" group.
To post to this group, send email to everything-list@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at 
http://groups.google.com/group/everything-list
-~----------~----~----~----~------~----~------~--~---

Reply via email to