X-VM-v5-Data: ([nil nil nil nil nil nil nil nil nil] ["1036" "Tue" "3" "November" "1998" "15:26:07" "+0100" "Hans Aberg" "haberg@MATEMATIK.SU.SE" nil "19" "Re: Quotes and punctuation" "^Date:" nil nil "11" nil nil nil nil nil] nil) X-POP3-Rcpt: schoepf@polly.zdv.Uni-Mainz.DE Received: from listserv.gmd.de (listserv.gmd.de [192.88.97.1]) by mail.Uni-Mainz.DE (8.8.8/8.8.8) with ESMTP id PAA11782; Tue, 3 Nov 1998 15:26:34 +0100 (MET) Received: from lsv1.listserv.gmd.de (192.88.97.2) by listserv.gmd.de (LSMTP for OpenVMS v1.1a) with SMTP id <7.CD0E7D74@listserv.gmd.de>; Tue, 3 Nov 1998 15:26:33 +0100 Received: from RELAY.URZ.UNI-HEIDELBERG.DE by RELAY.URZ.UNI-HEIDELBERG.DE (LISTSERV-TCP/IP release 1.8b) with spool id 407527 for LATEX-L@RELAY.URZ.UNI-HEIDELBERG.DE; Tue, 3 Nov 1998 15:26:28 +0100 Received: from mail0.nada.kth.se (mail0.nada.kth.se [130.237.222.70]) by relay.urz.uni-heidelberg.de (8.8.8/8.8.8) with ESMTP id PAA11771 for ; Tue, 3 Nov 1998 15:26:12 +0100 (MET) Received: from [130.237.37.116] (sl106.modempool.kth.se [130.237.37.132]) by mail0.nada.kth.se (8.8.7/8.8.7) with ESMTP id PAA22661 for ; Tue, 3 Nov 1998 15:25:40 +0100 (MET) X-Sender: su95-hab@mail.nada.kth.se References: <199811030953.JAA04308@nag.co.uk> <98102213123551@man.ac.uk>, <199811030953.JAA04308@nag.co.uk> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Message-ID: Reply-To: Mailing list for the LaTeX3 project In-Reply-To: <199811031356.HAA11625@dcdrjh.fnal.gov> Date: Tue, 3 Nov 1998 15:26:07 +0100 From: Hans Aberg Sender: Mailing list for the LaTeX3 project To: Multiple recipients of list LATEX-L Subject: Re: Quotes and punctuation Status: R X-Status: X-Keywords: X-UID: 2723 At 07:56 -0600 1998/11/03, Randolph J. Herber wrote: >I disagree with your second point---with sufficient encoding, any >semantic can be preserved, possibly with a time penalty (which are >ignored when discussing such equivalences). That is one of the >points of Goedel's Incompleteness (Undecidability) Theorem. Provided the semantics that one wants to describe can be expressed by binary numbers: For example, TeX proper cannot draw a non-straight spline curve no matter how you apply Turing theorems and Godel theorem, even though you can define structures simulating that TeX can handle that -- but that has no practical significance unless you figure out a way to extend TeX to print it. (In this example, even though the curve itself can be described by binary numbers, the capacity of printing it cannot.) Hans Aberg * Email: Hans Aberg * Home Page: * AMS member listing: