On Tue, Jul 04, 2006 at 01:03:20PM +0000, John Elliot wrote:A = Declarative languages are Turing Complete.
Note, your original claim was "Declarative languages are not Turing Complete".
A is not a negation of your original claim by any assumption of the missing determiners, hence A has no relevance to this discussion.
- You are subscribed to the progsoc mailing list. To unsubscribe, send a message containing "unsubscribe" to progsoc-request@xxxxxxxxxxxxxxxxxxx If you are having trouble, ask owner-progsoc@xxxxxxxxxxxxxxxxxx for help.