Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!clyde.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!hsdndev!cmcl2!kramden.acf.nyu.edu!brnstnd
From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein)
Newsgroups: comp.lang.misc
Subject: Re: syn-taxed [was Re: Complexity of syntax]
Message-ID: <23484:Jan619:01:5391@kramden.acf.nyu.edu>
Date: 6 Jan 91 19:01:53 GMT
References: <1991Jan5.081755.23488@agate.berkeley.edu> <14679:Jan509:13:1391@kramden.acf.nyu.edu> <19876@yunexus.YorkU.CA>
Organization: IR
Lines: 9

In article <19876@yunexus.YorkU.CA> oz@yunexus.yorku.ca (Ozan Yigit) writes:
>    ... we defined a rule of inference to be an effetive test to decide
>    wheter a string s can be deduced from a set of strings s1,...sn.

In the article that you're responding to I gave exactly such an
effective test. I conclude that the repeated-variable-in-declaration
problem is syntactic, by Minsky's definition (which I agree with). Done.

---Dan