On Jan 27, 2010, at 7:57 PM, Rob Freeman wrote:
> Ravi,
>
> On Wed, Jan 27, 2010 at 4:47 AM, ravi sharma <drravisharma@xxxxxxxxx> wrote:
>> ...
>> Is the computational irreducibility similar to irreducible representation in
>> group theory?
>
> Computational irreducibility is Wolfram's word, but I think so, yes.
>
> Both are random (in the Chaitin sense that there is nothing smaller which can 
>generate them.)
>
> You would need to find an analogue of decidability. Russell's paradox might 
>be a form of that.  (01) 
Russell's paradox has nothing whatever to do with decidability or 
irreducibility (whatever you think that means). Do you even know what 
Russell's paradox is?  (02)
Chris Menzel  (03)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/ 
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/ 
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/ 
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx  (04)