Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84; site psivax.UUCP Path: utzoo!watmath!clyde!cbosgd!ihnp4!qantel!hplabs!sdcrdcf!psivax!friesen From: friesen@psivax.UUCP (Stanley Friesen) Newsgroups: net.math Subject: Re: Mind as Turing Machine: a proof *and* a disproof! Message-ID: <848@psivax.UUCP> Date: Fri, 8-Nov-85 11:05:55 EST Article-I.D.: psivax.848 Posted: Fri Nov 8 11:05:55 1985 Date-Received: Mon, 11-Nov-85 06:46:06 EST References: <509@klipper.UUCP> <1096@jhunix.UUCP> <2081@umcp-cs.UUCP> <702@ecsvax.UUCP> <110@milford.UUCP> Reply-To: friesen@psivax.UUCP (Stanley Friesen) Distribution: net Organization: Pacesetter Systems Inc., Sylmar, CA Lines: 18 In article <110@milford.UUCP> bill@milford.UUCP (bill) writes: > >A more interesting question here might be "What type of machine can accept >an arbitrarily chosen natural language?" I suspect that English is not >a regular language nor a context-free language; is it context-sensitive? >Is it more?? > Some answers. No one knows -*yet*. Your suspicion is correct. Yes, it is at least context sensitive. Probably it is mor, I would say that it is "semantics-sensitive", that is the syntax depends on the meaning of the utterence! No formal language system, including context-sensitive languages permit this. -- Sarima (Stanley Friesen) UUCP: {ttidca|ihnp4|sdcrdcf|quad1|nrcvax|bellcore|logico}!psivax!friesen ARPA: ttidca!psivax!friesen@rand-unix.arpa