How would they ever know that I wonder?
Well let's see. I'm conscious and I'm not fallible. Therefore ;-)
David Barrett-Lennard wrote:
I'm wondering whether the following demonstrates that a computer that can
only generate thoughts which are sentences derivable from some
underlying
axioms
I agree with you. Actually you can use the second recursion theorem
of Kleene to collapse all the orders. This is easier in an untyped
programming language like (pure) LISP than in a typed language,
although some typed language have a primitive for handling untyped
self-reference, like the
:[EMAIL PROTECTED]
Sent: Tuesday, 20 January 2004 6:44 PM
To: [EMAIL PROTECTED]
Subject: Re: Are conscious beings always fallible?
I agree with you. Actually you can use the second recursion theorem
of Kleene to collapse all the orders. This is easier in an untyped
programming language like
3 matches
Mail list logo