Le Jeudi 8 Juin 2006 02:56, Russell Standish a écrit :
> 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.
Do you mean there exists programs which are not encodable in a finite string ?
Is this really a "program" then ? And I see plenty of non-halting program
which are perfectly writeable in a few instruction.
> (Assuming we identify all programs without taking the non-read bits
> into account).
--~--~---------~--~----~------------~-------~--~----~
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.domain.name.hidden
To unsubscribe from this group, send email to everything-list-unsubscribe.domain.name.hidden
For more options, visit this group at
http://groups.google.com/group/everything-list
-~----------~----~----~----~------~----~------~--~---
Received on Wed Jun 07 2006 - 22:23:29 PDT