========================================================================= Date: 18 February 1993, 12:52:03 PST From: James L. Hafner 408-927-1892 HAFNER at ALMADEN To: E1360DAB at AWIUNI11 Thanks for your note. You should be able to include any PostScript or Encapsulated PostScript into a colorized TeX document and it should print as you would expect. That is, what is included should print as it does when printed alone and the TeX stuff around it should be as you tried to instruct via the color macros. I displayed your sample file and got a mostly blue background, with some redish letters in big type with a white box containing some picture in a picture in a picture .... The picture itself is black. This is exactly what I would expect. The included graphics is wrapped in some gsave/grestore pair in the output of dvips, so it is NOT affected by the surrounding area. If it printed black on white by itself, it should do so here. If there where color in the embedded PostScript, it should print correctly too. Now about previewing. We don't use GhostScript here. We have our own PostScript rasterizer for which we have a multitude of output datastreams. We set up a special "device type" which can be displayed using another tool we have. It renders color bitmaps on the screen, much like xv, but with some different utilities. In any case, we have a pretty nice system here for displaying PostScript, though I imagine that there should be a reasonable path through ghostscript (or should that be ghostview). Regards, Jim Hafner ======================================================================== 23 Date: Fri, 19 Feb 93 14:57:32 MEZ From: "Svozil Karl, Ph.D." To: hafner@almaden Dear Dr. Hafner: thank you very much for your fast response. I am afraid that the pasting of a black-and-white object onto an otherwise color image is exactly my preblem; and probably not mine alone but a general problem if one uses the DVIPS COLOR and EPSF features *together*: in general, one has an black-and-white PostScript output from sources such as Mathematica et cetera, which one would like to colorise as well. Is there a "cheap way" to do this? Moreover, I would kindly like to ask if it is possible for us here to obtain your PostScript driver. Our platforms are Unix-like (IBM 6000 & PC's) and MS-DOS. I am sure, if necessary that the local IBM-Branch is willing to help, if necessary. Ghostscript/Ghostview is neither very convenient nor does it support too many colors. Thank you again for your attention & efforts| Karl Svozil (e1360dab at awiuni11.bitnet) ========================================================================= Date: 19 February 1993, 09:58:25 PST From: James L. Hafner 408-927-1892 HAFNER at ALMADEN To: E1360DAB at AWIUNI11 Subject: Note from you attached below Karl, There are serious potential difficulties in wanting the global status of a page to affect the included (E)PS region. Basically, the included region may have PostScript commands that conflict fatally with the rest of the PostScript. That can only be prevented by the current mechanism of gsave/grestore. Now, it is possible to produce color (E)PS files and use these to embed. For example, Mathematica lets you set color attributes to different objects (for example, plots can be done in any RGB parameters). Also, most drawing programs let you set the background, or foreground or other areas to a wide range of colors or patterns. It all depends on the application. CorelDraw has a large color palette, idraw has a small one, xfig I believe has only B/W. In any case, whatever they produce will embed correctly by dvips. If you generate something like that picture in your example, and you want the background of the picture to match the rest of the background, you will have to modify the picture itself. This probably means you will have to hack at the PostScript itself. For example, if you look at this part of your sample file, %%Page: 1 1 1 0 bop gsave BlueViolet clippath fill grestore YellowOrange you will determine that the "gsave ... grestore" part has set the background to BlueViolet. That color is defined in terms of CMYK values in the color.pro header file: /BlueViolet{0.86 0.91 0 0.04 setcmykcolor}DC You could probably modify your picture to get its background the same CMYK values (you probably can't use "BlueViolet" directly) and then you should get the same background on the whole page. As for the previewer, unfortunately it is strictly IBM internal use only at the moment, since it is really part of a product under development. Your note is being passed on to the people involved in the project. In particular, your comments on GhostScript/view are useful. Sorry I can't be of more help. Jim Hafner ------------------------------- Referenced Note --------------------------- Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:E1360DAB@AWIUNI11.EDVZ.UNIVIE.AC.AT> Received: from AWIUNI11.EDVZ.UNIVIE.AC.AT (NJE origin E1360DAB@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1c/1.7e) with BSMTP id 7665; Fri, 19 Feb 1993 14:58:21 +0100 Date: Fri, 19 Feb 93 14:57:32 MEZ From: "Svozil Karl, Ph.D." To: hafner@almaden Dear Dr. Hafner: thank you very much for your fast response. I am afraid that the pasting of a black-and-white object onto an otherwise color image is exactly my preblem; and probably not mine alone but a general problem if one uses the DVIPS COLOR and EPSF features *together*: in general, one has an black-and-white PostScript output from sources such as Mathematica et cetera, which one would like to colorise as well. Is there a "cheap way" to do this? Moreover, I would kindly like to ask if it is possible for us here to obtain your PostScript driver. Our platforms are Unix-like (IBM 6000 & PC's) and MS-DOS. I am sure, if necessary that the local IBM-Branch is willing to help, if necessary. Ghostscript/Ghostview is neither very convenient nor does it support too many colors. Thank you again for your attention & efforts| Karl Svozil (e1360dab at awiuni11.bitnet) ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT,@CUNYVM.CUNY.EDU:pwm@t4.lanl.gov> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1c/1.7e) with BSMTP id 5482; Tue, 23 Feb 1993 00:40:22 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1c/1.7e) with BSMTP id 0456; Mon, 22 Feb 1993 18:39:27 -0500 Received: from p.lanl.gov by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Mon, 22 Feb 93 18:39:25 EST Received: from t4.lanl.gov by p.lanl.gov (5.65/1.14) id AA11692; Mon, 22 Feb 93 16:40:13 -0700 Received: from photon.lanl.gov by t4.lanl.gov (4.1/SMI-4.1) id AA06698; Mon, 22 Feb 93 16:32:26 MST Date: Mon, 22 Feb 93 16:32:26 MST From: pwm@t4.lanl.gov (Peter Milonni) Message-Id: <9302222332.AA06698@t4.lanl.gov> To: e1360dab@awiuni11.BITNET Subject: Book Draft Correspondence 22 February 1993 To: Dr. Karl Svozil, ITP, Vienna From: Peter Milonni Dear Karl, I have finally read through a fair portion of the draft of your book. Thanks for sending it - I will certainly buy a copy when it's out if you promise to autograph it next time we meet! I have not followed all of the mathematical formalism in detail, but the physical content is appealling. It is infinitely more understandable than anything of Chaitin's, and of course has a lot more physics. By the way, I'm glad you mentioned Jaynes's work - I have co-edited a volume on Physics and Probability (Cambridge, in press) dedicated to Jaynes on the occasion of his retirement. I'm busy as usual. I hope all is well with you. All the best, Peter ======================================================================== 23 Date: Tue, 23 Feb 93 10:22:50 MEZ From: "Svozil Karl, Ph.D." To: PWM%t12@LANL.GOV Dear Peter: many thanks for the encouraging remarks; I am just going through the pains of what I have decided will be the final corrections/revisions. Could you please let me know the exact title et cetera of the CU book on Jaynes, so that I can order it? Jaynes' approach to entropy is so much clearer than most of the WODOO I have heard about that topic. By the way: if you are planning to come to Vienna at any time, please let me kn ow (the earlier the better) --- I will be able to put up some money, and I woul d be glad to have you here again. Personally, I am O.K.; we have a baby now (approximately eight months old); he is what one calls ``a lovely child.'' Some house construction work is also goin g on (not by myself, fortunately); it keeps me busy and away from too much mela ncholy. Best greetings & wishes, Karl ======================================================================== 17 Date: Tue, 23 Feb 93 10:35:38 MEZ From: "Svozil Karl, Ph.D." To: VOSS@YKTVMT Dear Richard: Do you know of any work which deals with the construction of random fractal pat terns *locally*, not globally, i.e., on a bit-per-bit basis instead of the whol epattern at once? --- probably there are thousands which I am not aware of; in this case please forgive me. Many thanks for your help, Karl Svozil (e1360dab at awiuni11.bitnet) p.s.: I have a student, who also is a musician, who re-programed fractal music for a seminar here (in Mathematica) --- sou nds great| ======================================================================== 14 Date: Tue, 23 Feb 93 12:33:27 MEZ From: "Svozil Karl, Ph.D." To: Tech-Support@Math.AMS.com Dear Collegues: I am presently writing a book with TEX/LATEX, using AMS-fonts. Do I have to acknowledge use of any of these products? Thank you for your attention & efforts| Karl Svozil (e1360dab at awiuni11.bitnet) p.s.: the fonts are great| Congratulations| ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:voss@watson.ibm.com> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1c/1.7e) with BSMTP id 2366; Wed, 24 Feb 1993 01:52:49 +0100 Received: from watson.ibm.com by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Wed, 24 Feb 93 01:52:48 MEZ Received: from YKTVMV by watson.ibm.com (IBM VM SMTP V2R2) with BSMTP id 9167; Tue, 23 Feb 93 19:52:53 EST Date: Tue, 23 Feb 93 19:49:34 EST From: "Richard F. Voss ((914) 945-2855)" To: E1360DAB@AWIUNI11.EDVZ.UNIVIE.AC.AT Subject: Your note of Tue, 23 Feb 93 10:35:38 MEZ Karl, I'm not sure I understand the question. In what Euclidian dimension? Sets or measures? What do you mean by LOCAL? A random fractal HAS SPATIAL CORRELATION! If you generate each bit independently, you lose the correlation. rfv ======================================================================== 62 Date: Wed, 24 Feb 93 12:23:25 MEZ From: "Svozil Karl, Ph.D." To: VOSS@YKTVMT Dear Richard: by a *global* construction of a random fractal (RF) I mean a construction which renders the whole RF at once, whereas a *local* construction generates a RF bit-by-bit (see below). As you mention in your papers, RF can be constructed by Fourier transformation, by dice counting as reported in M. Gardner's Scientific American article, by random cuts et cetera. One could, for instance, argue that in order to get a single event in time from a construction using Fourier transformation, knowledge of the whole range of frequency components is necessary, specifying the other events as well. I have the feeling that natural processes featuring 1/f noise are not produced that way. To take it to the extremes: a system would have to posess advance information about all future events. Therefore (and also for practical reasons), I try to find ways to approximate a 1/f spectrum bit-by-bit. With bit-by-bit I mean that one generates a binary sequence (representing events like nerve spike activity) of dimension, say, 0 Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1c/1.7e) with BSMTP id 8725; Wed, 24 Feb 1993 14:44:34 +0100 Received: from vs3002.ams.org by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Wed, 24 Feb 93 14:44:31 MEZ Received: from MATH.AMS.ORG by MATH.AMS.ORG (PMDF #2306 ) id <01GV3DVN0XGWGAUZQP@MATH.AMS.ORG>; Wed, 24 Feb 1993 08:43:04 EST Date: 24 Feb 1993 08:43:04 -0500 (EST) From: AMS Technical Support In-reply-to: <01GV1VBSWI36GAUZEP@MATH.AMS.ORG> To: E1360DAB@AWIUNI11.EDVZ.UNIVIE.AC.AT Cc: tech-support@MATH.AMS.ORG Reply-to: tech-support@MATH.AMS.ORG Message-id: <730561384.512787.JUL@MATH.AMS.ORG> Content-transfer-encoding: 7BIT Mail-System-Version: No, but if you use our AMS-TeX package to tex your documents you would have to acknowledge your use of it. Julie Hawks Technical Support American Mathematical Society Phone: 800-321-4AMS (321-4267) or 401-455-4080 Internet: TECH-SUPPORT@MATH.AMS.ORG ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:voss@watson.ibm.com> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1c/1.7e) with BSMTP id 3101; Wed, 24 Feb 1993 18:27:38 +0100 Received: from watson.ibm.com by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Wed, 24 Feb 93 18:27:37 MEZ Received: from YKTVMV by watson.ibm.com (IBM VM SMTP V2R2) with BSMTP id 4565; Wed, 24 Feb 93 12:27:18 EST Date: Wed, 24 Feb 93 12:18:38 EST From: "Richard F. Voss ((914) 945-2855)" To: E1360DAB@AWIUNI11.EDVZ.UNIVIE.AC.AT Subject: Your note of Wed, 24 Feb 93 12:23:25 MEZ Karl, The "dice" algorithm (which I gave to Martin Gardner) does (in a sense) what you want and is equivalent to your description. Similar algorithms become MUCH harder in more than one dimension. All such process need to keep an "infinite time" memory of their past history in order to generate new events with "infinite" correlations. In practice, it seems sufficient to keep a memory only on logarithmically spaced intervals (2,4,8,16...) as is done in the dice algorithm (this effectively defines the lacunarity of the process). In one of Mandelbrot's original articles on fBm he describes another such process using a power-law decaying kernel over the entire past history (I forget exactly WHICH reference). All of the midpoint displacement algorithms (including my "successive random additions") actually work in a similar manner but could be used to generate a "low resolution" view of the future while filling in the detail only at the "present". Best of luck. rfv ======================================================================== 14 Date: Thu, 25 Feb 93 16:09:27 MEZ From: "Svozil Karl, Ph.D." To: "Prof. Dr. G. Chaitin" Dear Greg: I just remembered that you will be coming to Vienna soon. I am very much looking forward to meet you again. If I can be of any help (picking you from the airport et cetera), please let me know. When will you be coming exactly? Best greetings & wishes, Karl (e1360dab at awiuni11.bitnet) ======================================================================== 17 Date: Fri, 26 Feb 93 12:09:42 MEZ From: "Svozil Karl, Ph.D." To: VOSS@YKTVMT Dear Richard: thank you very much for the recent e-mail. I think that I got the idea now; I also see that your 1/f dice algorithm reviewed in Gardners' article produces random fractal patterns in a sequential form. My last question (for a while) --- I hope that you dont mind asking such silly stuff all the time: do you know of any plausible *explanation* for 1/f noise for some physical system? Thanks again for your attention & efforts. Karl Svozil (e1360dab at awiuni11.bitnet) ======================================================================== 14 Date: Fri, 26 Feb 93 12:45:21 MEZ From: "Svozil Karl, Ph.D." To: "Prof. Dr. G. Chaitin" Dear Greg: I have just coordinated myself with Richard Zach from the Gºdel Society here. We arranged that I shall pick you up from the airport. He is going to forward to me your recent e-mail containing the exact time of your arrival. (I can see that they are organising the hell of a lot of talks in Vienna|) Best greetings & very much looking forward to see you soon| Karl (e1360dab at awiuni11.bitnet) ======================================================================== 11 Date: Fri, 26 Feb 93 16:06:57 MEZ From: "Svozil Karl, Ph.D." To: "Prof. Dr. G. Chaitin" Dear Greg: I just got your exact arrival dates: Sunday, March 7, 8.50 am (uuhh early|) at Vienna airport from NY JFK (AS502). I'll pick you up. Best wishes, Karl ======================================================================== 5 Date: Tue, 02 Mar 93 09:50:21 MEZ From: "Svozil Karl, Ph.D." To: "Prof. Dr. G. Chaitin" Dear Greg: I got your arrival dates. Tank you. Karl ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:KGS@LOGIC.TUWIEN.AC.AT> Received: from AWITUW64.BITNET (NJE origin MAILER@AWITUW64) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 2688; Fri, 26 Feb 1993 13:49:31 +0100 Return-Path: Received: from csdec2.tuwien.ac.at by email.tuwien.ac.at (5.65b/1.34-MHS) id AA09662; Fri, 26 Feb 93 13:49:32 +0100 Received: by logic.tuwien.ac.at (5.65/DEC-Ultrix/4.3) id AA00952; Fri, 26 Feb 1993 13:49:31 +0100 Message-Id: <9302261249.AA00952@logic.tuwien.ac.at> To: E1360DAB@awiuni11 Subject: Chaitin Date: Fri, 26 Feb 93 13:49:30 +0100 From: kgs@logic.tuwien.ac.at X-Mts: smtp Institut fuer Mathematik Institut fuer Statistik, OR und Computerverfahren Kurt-Goedel-Gesellschaft Vortragsankuendigung -------------------- GREGORY J. CHAITIN ================== (IBM Thomas J. Watson Research Center, New York) Algorithmic Information Theory ------------------------------ Montag, 8. Maerz 1993, 18:00 Hoersaal FH HS 3, Technische Universitaet Wien, Freihaus, Wiedner Hauptstrasse 8-10, 1040 Wien, gelber Bereich, 2. OG The LISP Halting Probability ---------------------------- Dienstag, 9. Maerz 1993, 17:00 Hoersaal des Instituts fuer Statistik, Operations Research und Computerverfahren, Universitaet Wien, Universitaetsstrasse 5/3, 1010 Wien The Berry Paradox ----------------- Mittwoch, 10. Maerz 1993, 16:00 ------- Forwarded Message Return-Path: <@CUNYVM.CUNY.EDU:CHAITIN@YKTVMV> Received: from YKTVMV by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with BSMTP id 5948; Mon, 18 Jan 93 13:15:04 EST Date: Mon, 18 Jan 93 12:42:52 EST From: CHAITIN%YKTVMV.bitnet@CUNYVM.CUNY.EDU To: kgs Subject: Vienna visit Status: RO Dear Prof. Zach: Thank you for your e-mail of 15 Jan 93. Here are the lectures that I propose to give in Vienna: 1) Technical University of Vienna Date: Monday, 8 March 1993 Host: Prof. Richard Zach Title: Algorithmic Information Theory Abstract: We survey algorithmic information theory and discuss information-theoretic incompleteness. 2) Mathematics Institute, University of Vienna Date: Wednesday, 10 March 1993 Host: Prof. Christian Reichel Title: The Berry Paradox Abstract: In the same manner that Goedel's proof is based on the paradox of the liar, my information- theoretic incompleteness theorems are based on the Berry paradox. (I have already sent this title and abstract to Prof. Reichel.) 3) Department of Statistics and Computer Science Date: ??? Host: Prof. Jimmy Schimanovich Title: The LISP Halting Probability Abstract: We give an overview of the LISP programming language and the theory of LISP program size, and discuss applications to information-theoretic incompleteness. (I would be grateful if you could communicate this title and abstract to Prof. Schimanovich.) All three talks will be technical. At all three talks I will distribute copies of my non-technical lecture "Randomness in Arithmetic and the Decline and Fall of Reductionism in Pure Mathematics". Here are my travel arrangements. I will arrive in Vienna Sunday 7 March 1993 at 8:50 am on Austrian Air flight 502 from NYC/Kennedy. I will stay at Pension Pertschy, Habsburgergasse 5. And I will leave Vienna Saturday 13 March 1993 at 11:45 am on Austrian Air flight 501 to NYC/Kennedy. (Unfortunately I have to leave before Prof. John Casti arrives in Vienna.) Best wishes for 1993! Gregory Chaitin ------- End of Forwarded Message ========================================================================= Date: Mon, 1 Mar 93 11:09:21 EST From: CHAITIN@YKTVMV To: E1360DAB@AWIUNI11 Subject: reply Hi Karl! Yes, that is my schedule: Leave NYC/Kennedy 6:15 pm Saturday 6 Mar 93 on Austrian Air flight 502. Arrive Vienna 8:50 am Sunday 7 Mar 93. Hotel: Pension Pertschy, Habsburgergasse 5. Phone: +43-1-534 49 Thank you very much for coming to the airport to pick me up. Looking forward to seeing you again! Regards, Greg ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:voss@WATSON.IBM.COM> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 2329; Tue, 2 Mar 1993 18:24:53 +0100 Received: from watson.ibm.com by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Tue, 02 Mar 93 18:24:51 MEZ Received: from YKTVMV by watson.ibm.com (IBM VM SMTP V2R3) with BSMTP id 0831; Tue, 02 Mar 93 12:24:55 EST Date: Tue, 2 Mar 93 12:24:55 EST From: "Richard F. Voss ((914) 945-2855)" To: E1360DAB@AWIUNI11.EDVZ.UNIVIE.AC.AT Subject: Your note of Fri, 26 Feb 93 12:09:42 MEZ A number of physical explanations have been offered for 1/f noise, particularly in electronic systems. All involve some way of generating a wide variety of time constants for example via 1) tunnelling through a distribution of barrier heights, 2) diffusion, 3) motion of vacancies. See, for example, the review articles: Dutta and Horn, Rev. Mod. Phys. 53 497 (1981). A. van der Ziel, Adv. Electronics and Electron Phys. 49, 225 (1979). Weissman, Proc. 6th Int. Conf. on Noise in Phys. Systems (NBS Special Publication 614, Gaithersburg Md 1981) p. 133 rfv ======================================================================== 9 Date: Thu, 04 Mar 93 12:36:59 MEZ From: "Svozil Karl, Ph.D." To: "Dr. Ron Whitney" Dear Dr. Whitney: referring to your TUGBOAT article (with C. Mylonas) on Greek fonts I kindly like to ask you if these are available publicly. Thank you for your attention. Karl Svozil (e1360dab at awiuni11.bitnet) ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:RFW@MATH.AMS.ORG> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 3971; Thu, 4 Mar 1993 14:48:05 +0100 Received: from vs3002.ams.org by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Thu, 04 Mar 93 14:48:04 MEZ Received: from MATH.AMS.ORG by MATH.AMS.ORG (PMDF #2306 ) id <01GVEKIU5AC0GUTJXY@MATH.AMS.ORG>; Thu, 4 Mar 1993 08:47:38 EST Date: 04 Mar 1993 08:47:37 -0500 (EST) From: Ron Whitney In-reply-to: <01GVEG1T6Y3MGW2K9Y@MATH.AMS.ORG> To: E1360DAB@AWIUNI11.EDVZ.UNIVIE.AC.AT Message-id: <731252857.43199.RFW@math.ams.org> Content-transfer-encoding: 7BIT Mail-System-Version: Dr. Svozil, My role on the fonts was that of technical advisor to Costa Mylonas who is the creator and owner of the fonts. Several people have inquired about their availability, and to my knowledge, Costa has not released them. He is in Greece at the moment, but is scheduled to visit Brown sometime this spring. I can ask him again about release or you could try reaching him directly. He doesn't use an email address, so the street address given in the article is the best means of contact. It's unfortunate that this is the situation. I'm not sure why Costa has held these so close to his vest. Perhaps he feels they're not ready for release or he's not willing to answer questions that might come up. I find the fonts attractive and think a number of people would like to use them. -Ron ======================================================================== 10 Date: Thu, 04 Mar 93 17:00:59 MEZ From: "Svozil Karl, Ph.D." To: vacsc0rf@vax.csun.edu Dear Dr. Salomon: in reference to your TUGBOAT article on creating shapes in PostScript, I would kindly like to ask you if you could send me the *shade* macro electronically. Thank you very much for your attention & efforts. Yours sincerely, Karl Svozil (e1360dab at awiuni11.bitnet) ======================================================================== 11 Date: Fri, 05 Mar 93 12:08:29 MEZ From: "Svozil Karl, Ph.D." To: dhosek@ymir.claremont.edu Dear Don: I just came across your article ``Siamese TEX...'' in the December '91 issue of TUGBOAT. Referring to footnote 7 I have a question: how do you manage to create a CHR file with the Adobe Type Manager? Thanks for your attention, Karl Svozil (e1360dab at awiuni11.bitnet) ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:DHOSEK@HMCVAX.CLAREMONT.EDU> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 2317; Sat, 6 Mar 1993 11:33:11 +0100 Received: from HMCVAX.CLAREMONT.EDU by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Sat, 06 Mar 93 11:33:08 MEZ Received: from HMCVAX.CLAREMONT.EDU by HMCVAX.CLAREMONT.EDU (PMDF #2326 ) id <01GVGGC0Z33M9AMH16@HMCVAX.CLAREMONT.EDU>; Fri, 5 Mar 1993 17:10:10 PST Date: 05 Mar 1993 17:10:10 -0800 (PST) From: Don Hosek To: E1360DAB@AWIUNI11.EDVZ.UNIVIE.AC.AT Message-id: <01GVGGC0Z33O9AMH16@HMCVAX.CLAREMONT.EDU> X-VMS-To: IN%"E1360DAB@AWIUNI11.EDVZ.UNIVIE.AC.AT" MIME-version: 1.0 Content-transfer-encoding: 7BIT That statement was based on erroneous information... Adobe does distribute a program which claims to make HP soft fonts from type 1 and there are soft font to PK programs available on the net. -dh ======================================================================== 11 Date: Mon, 08 Mar 93 14:08:51 MEZ From: "Svozil Karl, Ph.D." To: karl@cs.umb.edu Dear Dr. Berry: I would kindly like to ask you if you know whether there are any *.PFB (*.PFA) -> PK programs available? - My problem is that I use soft-fonts in PFB format under MS-DOS, but I cant preview them with the View emTex command. Thank you for yxour attention. Karl Svozil (e1360dab at awiuni11.bitnet) ========================================================================= ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:karl@CLAUDE.CS.UMB.EDU> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 5044; Mon, 8 Mar 1993 21:50:44 +0100 Received: from claude.cs.umb.edu by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Mon, 08 Mar 93 21:50:42 MEZ Received: by claude.cs.umb.edu id AA25115 (5.65c/IDA-1.4.4 for E1360DAB@helios.edvz.univie.ac.at); Mon, 8 Mar 1993 15:50:45 -0500 Date: Mon, 8 Mar 1993 15:50:45 -0500 From: Karl Berry Message-Id: <199303082050.AA25115@claude.cs.umb.edu> To: E1360DAB@helios.edvz.univie.ac.at In-Reply-To: "Svozil Karl, Ph.D."'s message of Mon, 08 Mar 93 14:08:51 MEZ <199303081312.AA03546@cs.umb.edu> Reply-To: karl@cs.umb.edu Dear Dr. Berry: Just call me Karl. I'm not a Dr., for one thing. I would kindly like to ask you if you know whether there are any *.PFB (*.PFA) -> PK programs available? - My problem is that I use soft-fonts ps2pk.tar.Z on ftp.tue.urc.nl (I think -- try archie if not there) is probably your best best. ======================================================================== 43 Date: Thu, 11 Mar 93 13:24:19 MEZ From: "Svozil Karl, Ph.D." To: rcpt@urc.tue.nl Dear Piet: I experience some problems with unzipping your zip-files; e.g., ps2pk13.zip unzips like: ------------------------------------------------------------------------- Script V1.1 session started Thu Mar 11 09:43:30 1993 Received: by rw8.urc.tue.nl id AA06637 (5.65c/IDA-1.4.4 for E1360DAB@helios.edvz.univie.ac.at); Thu, 11 Mar 1993 21:04:46 +0100 Message-Id: <199303112004.AA06637@rw8.urc.tue.nl> From: P.T.H.Tutelaers@urc.tue.nl (Piet Tutelaers) Date: Thu, 11 Mar 1993 21:04:44 MET In-Reply-To: "Svozil Karl, Ph.D." (Mar 11, 13:28) X-Mailer: Mail User's Shell (7.1.2 7/11/90) To: "Svozil Karl, Ph.D." , P.T.H.Tutelaers@urc.tue.nl [ "Svozil Karl, Ph.D." (Mar 11, 13:28): > Dear Piet: > > I experience some problems with unzipping your zip-files; e.g., ps2pk13.zip > unzips like: > > ------------------------------------------------------------------------- > > Script V1.1 session started Thu Mar 11 09:43:30 1993 > > PS2PK13.ZIP has errors! > > Script completed Thu Mar 11 09:43:33 1993 > > ----------------------------------------------------------------------------- > > Can you help me? Thank you for your attention & efforts. > Best greetings, > Karl Svozil > (e1360dab at awiuni11.bitnet) ] The zip files are made with the UNIX zip. These are incompatible with the version you have. You need a newer version. It can be found on: ftp.urc.tue.nl:/pub/tex/emtex/min_emtex/install/pkunzip.exe Success! --Piet ======================================================================== 7 Date: Mon, 15 Mar 93 10:25:29 MEZ From: "Svozil Karl, Ph.D." To: rcpt@urc.tue.nl Dear Piet: the unzipping works| Thank you very much for your help| Karl ========================================================================= Date: Tue, 16 Mar 93 16:43:35 EST From: CHAITIN@YKTVMV To: E1360DAB@AWIUNI11 Subject: misc info Hi Karl! The Romanian Prof Dr Cristian Calude has the following e-mail address: cristian @ cs.aukuni.ac.nz Here is the address of the philosopher who wrote on Plato and algorithmic information theory: Dr F Walter Meyerstein Tavern, 45 08006 Barcelona SPAIN The Solovay Brazil reference is: R. M. Solovay, ``On Random R.E. Sets,'' {\it Non-Classical Logics, Model Theory, and Computability,\/} A. I. Arruda, N. C. A. da Costa, and R. Chuaqui (eds.), North-Holland, Amsterdam, 1977, pp.\ 283--307. Regards to Karen! Greg ======================================================================== 8 Date: Wed, 17 Mar 93 12:01:03 MEZ From: "Svozil Karl, Ph.D." To: "Prof. Dr. G. Chaitin" Dear Greg: thank you very much for the information, and also for the stimulatin g discussions while you were in Vienna. I hope that you arrived well in the US; I felt very uneasy when I heard about the snowstorm. Best greetings and wishes, Karl ======================================================================== 18 Date: Fri, 19 Mar 93 13:23:33 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Professor Calude: thank you very much for your recent e-mail. I would be *very much* interested in your work on complexity theory||| - I was aware of your book and cited it al ready -, also your new book on which you are working. My book project on randomness & undecidability in physics reaches hopefully a "final" stage;the part on randomness in mathematics needs some revisions; i hop e that I could finish these next week. I could certainly send you the tex-files (approx. 1.4 MB), but I am not sure if you could compile them, because I am usi ng weird macros. Icould alternatively send you a hardcopy. Best wishes & many thanks for your recent e-mail| Karl Svozil ========================================================================= Date: Thu, 18 Mar 93 16:22:35 EST From: CHAITIN@YKTVMV To: E1360DAB@AWIUNI11 Subject: reply Dear Karl: Thanks for your hospitality in Vienna! Yes, the East Coast was really buried in snow; it was an adventure getting back home. Regards, Greg ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 9585; Fri, 19 Mar 1993 01:00:57 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 8409; Thu, 18 Mar 1993 18:59:58 -0500 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Thu, 18 Mar 93 18:59:54 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GVZRL0L4F48Y7H6G@aukuni.ac.nz>; Fri, 19 Mar 1993 12:56:52 +1300 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA09477; Fri, 19 Mar 93 10:59:59 +1300 Date: Fri, 19 Mar 93 10:59:59 +1300 From: cristian@cs.aukuni.ac.nz Subject: Randomness To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9303182159.AA09477@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz To Prof.Dr. Karl SVOZIL TUW, Austria Dear Professor Svozil, Greg Chaitin told me that you are writing a book on randomness and undecidability in physiscs. I am very interested in randomness and undecidability from the mathematical point of view (where I have published some papers and a monograph - Theories of Computatational Complexity, North-Holland, amsterdam, 1988, 500 pp.). Presently, I am finishing a book entitled "Information and Randomness - An Algorithmic Perspective" to be published by Springer Verlag. My book will contain a special chapter devoted to applications, including physics. I will be very grateful to have a draft copy of your book (and related papers) in order to use and quote them properly in my book. Latex version will be OK for me. Also, I may send you some of my papers and the draft of the finished part of my book, in case you may be interested in them. Best regards, Cris Calude ------------------------------------- Cristian Sorin Calude Computer Science Department The University of Auckland Private Bag 92019 Auckland, New Zealand Tel. +64 - 9 - 373 -7599 ext. 5751 Fax : +64 - 9 - 373 - 7453 Email: cristian@cs.auckland.ac.nz ========================================================================= Date: Sun, 21 Mar 93 00:30 EST From: KIM@umdhep Subject: Squeezed states and uncertainty relations To: e1360dab@AWIUNI11.BITNET Message-id: <62F7847FC09FE0024B@umdhep> X-Envelope-to: e1360dab@AWIUNI11.BITNET X-VMS-To: IN%"e1360dab@awiuni11" THIRD INTERNATIONAL WORKSHOP on SQUEEZED STATES and UNCERTAINTY RELATIONS August 10-13, 1993 University of Maryland Baltimore County, Baltimore, Maryland Jointly organized by the University of Maryland and the Lebedev Physical Institute of the Russian Academy of Sciences The purpose of these workshops has been and still is to provide an opportunity for discussing the latest developments in the study of squeezed states and their influence on the foundations of quantum theory, especially, related to the uncertainty principle and measurement theory. This workshop will include discussions of squeezed states in optics and in high energy physics, measurement theory, the foundations of quantum theory, EPR experiment and two-photon interferometry, wavelets, and the Lorentz group. PRINCIPAL ORGANIZERS M. H. Rubin (Univ. of Maryland Baltimore County) Y. H. Shih (Univ. of Maryland Baltimore County) For an invitation to attend this Workshop, contact Morton H. Rubin or Yanhua Shih (University of Maryland Baltimore County, Dept. of Physics, Baltimore, MD 21228-5398, USA, Tel. (410) 455-2532, FAX (410) 455-1072, e-mail rubin@umbc3.umbc.edu ORGANIZING COMMITTEE C. O. Alley (Univ. of Maryland College Park) V. Dodonov (Moscow Physical Institute of Technology) D. Han (NASA Goddard Space Flight Center) V. Isakov (Lebedev Physical Institute) J. Janszky (Research Lab. for Crystal Physics, Budapest) Y. S. Kim (Univ. of Maryland College Park) C. S. Lee (Univ. of Maryland College Park) M. A. Man'ko (Lebedev Physical Institute) V. I. Man'ko (Lebedev Physical Institute) P. McGrath (Laboratory for Physical Science) H. S. Pilloff (Office of Naval Research) A. V. Vinogradov (Lebedev Physical Institute) W. W. Zachary (Howard University) INVITED SPEAKERS Carlton M. Caves (University of New Mexico) Raymond Y. Chiao (University of California at Berkeley) Brian DeFacio (University of Missouri at Columbia) Edward S. Fry (Texas A&M University) Daniel Greenberger (City College of CUNY) Hermann A. Haus (Massachusetts Institute of Technology) Gerhard Hegerfeldt (Universitat Gottingen) V. P. Karassiov (Lebedev Institute) L. V. Keldysh (Lebedev Physical Institute) David N. Klyshko (Moscow State University) V. Alan Kostelecky (Indiana University) Willis E. Lamb Jr (University of Arizona) Leonard Mandel (University of Rochester) Ady Mann (Technion/Israel Institute of Technology) Roland Omnes (Universite de Paris XI) Masanao Ozawa (Nagoya University) V. I. Ritus (Lebedev Physical Institute) Marlan O. Scully (Texas A&M University) Abner Shimony (Boston University) E. C. G. Sudarshan (University of Texas at Austin) L. A. Wu (Beijing Institute of Physics) Horace P. Yuen (Northwestern University) Anton Zelinger (University of Innsbruck) This workshop is supported in part by the Office of Naval Research, the Laboratory for Physical Science, the Goddard Space Flight Center of the National Aeronautics and Space Administration, and by the University of Maryland. The deadline for registration is June 15, 1993. Please read the following conference information and, to register, return the following form with remittance of fees. HOUSING: Housing will be provided on the UMBC campus. Guests will stay in air conditioned dormitories, in double occupancy rooms. Each pair of double occupancy rooms will share one bath. The cost is $17 per night. A few single rooms are available at $22 per night. For those who wish to stay off-campus, a block of rooms has been reserved at the Sheraton International Hotel, located adjacent to the Baltimore/Washington International airport, just a 15 minute drive from the UMBC campus. To receive the special rate of $70 per night, call the Sheraton International Hotel directly at (410) 859- 3300 before July 26, 1993, and identify yourself as a participant of this conference. Transportation between the Sheraton and UMBC is not provided except by taxi, private or rented automobile. MEALS: Breakfast, lunch and dinner will be provided, buffet style, in the university dining hall. Cost for campus meals, beginning with dinner on August 9, is $67 for the four days of the workshop. The University Center Cafeteria is also open on campus each day from 8:00 AM through 6:30 PM. CONTRIBUTIONS TO THE WORKSHOP: The scientific program will consist of invited papers and shorter contributed papers. Abstracts should be sent as soon as possible. The deadline for accepting contributions is April 1. If you wish to contribute a paper, please send the abstract as soon as possible. Submitted papers will be reviewed by the organizing committee. Unfortunately, because of time limitations, not all papers can be allotted time on the program. If a paper is accepted for presentation, the speaker will be informed of the time that will be allotted to that paper. There will be printed proceedings of all talks presented at the conference. Send abstracts to: PHYSICS WORKSHOP 93 PHYSICS DEPARTMENT UNIVERSITY OF MARYLAND BALTIMORE COUNTY BALTIMORE, MD 21228-5398 GRADUATE STUDENTS: We anticipate that limited funds will be available as stipends for graduate students. Any student who wishes to apply for these funds should complete a registration form indicating the total funding anticipated to be paid by your institution, and including a brief statement from your research advisor indicating how the meeting will be useful for your research. Be sure to complete the following REGISTRATION FORM and return it with your fees no later than June 15, 1993. We will send additional information with confirmation of your registration. PLEASE COMPLETE THIS REGISTRATION FORM AND RETURN AS INDICATED BELOW. NAME: ________________________________________________________ MALE: __________ FEMALE: __________ TELEPHONE: _____________________ FAX: _______________________ E-MAIL: ________________________ INSTITUTION: __________________________________________________ DEPARTMENT: ___________________________________________________ MAILING ADDRESS: __________________________________________ ARRIVAL DATE: ________________ DEPARTURE DATE: _____________ ADDITIONAL PERSON(S) (NOT CONFEREES) IN YOUR PARTY: _______________________________________ MALE: _____ FEMALE: ______ Family Name First Name _______________________________________ MALE: _____ FEMALE: _____ Family Name First Name FEES Registration includes conference materials, and a conference dinner on Thursday. REGISTRATION, BEFORE JUNE 15, 1993 $175 ___________ AFTER JUNE 15, 1993 $200 ___________ STUDENT, BEFORE JUNE 15, 1993 $ 50 ___________ AFTER JUNE 15, 1993 $ 70 ___________ There will be an additional $25 fee for registration at the workshop. UMBC DORMITORY HOUSING DOUBLE OCCUPANCY AT $17 PER NIGHT PER PERSON - TOTAL ___________ SINGLE OCCUPANCY AT $22 PER NIGHT - TOTAL ___________ UMBC MEAL PLAN $ 67 PER PERSON - TOTAL ___________ (FOR ENTIRE CONFERENCE) TOTAL REMITTANCE ___________ FEES ENCLOSED: ______ FEES TO BE SENT SEPARATELY: ______ (You are not officially registered until fees are received. When fees are received, confirmation and additional information will be sent.) PLEASE SEND CHECK OR MONEY ORDER, IN U.S. DOLLARS, PAYABLE TO UMBC - PHYSICS WORKSHOP 93. IF YOU WISH TO PAY BY CREDIT CARD, PLEASE COMPLETE THE FOLLOWING: VISA _______ MASTERCARD _______ CARD NUMBER: _______________________________________ CARD EXPIRATION DATE: _______________________________ SIGNATURE (if mailed): ______________________________ Thank you for your registration to the Third International Workshop os Squeezed States and Uncertainty Relations. You may return this information by E-MAIL to : RUBIN@UMBC3.UMBC.EDU or SHIH@UMBC.Bitnet. Or, FAX this information to: UMBC Continuing Education (410) 455-1074 Or, you may mail this form and fees to: THIRD INTERNATIONAL WORKSHOP ON SQUEEZED STATES UNIVERSITY OF MARYLAND BALTIMORE COUNTY CONTINUING EDUCATION BALTIMORE, MARYLAND 21228-5398 Questions pertaining to registration should be directed to Dr. Carolyn Harriger at the above address, or phone (410) 455-2336. ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 0711; Sun, 21 Mar 1993 21:49:46 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 8311; Sun, 21 Mar 1993 15:48:48 -0500 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Sun, 21 Mar 93 15:48:45 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GW3RURFP6O8Y5LWL@aukuni.ac.nz>; Mon, 22 Mar 1993 09:47:52 +1300 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA15272; Mon, 22 Mar 93 08:48:14 +1200 Date: 22 Mar 1993 08:48:14 +1200 From: cristian@cs.aukuni.ac.nz Subject: papers To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9303212048.AA15272@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Professor Svozil, Many thanks for your kind message. I am looking forward receiving your book in hard copy. Also, I would be very grateful to receive reprints of your early work pertaining randomness and complexity (including the papers quoting my '88 book). I will be glad to mail you a selection of my papers; just be kind and send me your full address in Wienna. My book is written in Latex; please let me know in what format do you prefer to send you the draft part of chapters 2-5? Chapter 6 is now in the final process of polishing and chapter 7 (applications) will be finished after receiving your papers. Best regards and good luck for your project! Cris ....................... Cristian Sorin Calude Computer Science Department The University of Auckland Private Bag 92019 Auckland, New Zealand Tel. +64 - 9 - 373 -7599 ext. 5751 Fax : +64 - 9 - 373 - 7453 Email: cristian@cs.auckland.ac.nz ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 1679; Mon, 22 Mar 1993 00:50:17 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 1213; Sun, 21 Mar 1993 18:49:17 -0500 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Sun, 21 Mar 93 18:49:13 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GW3Y681J808Y7TVH@aukuni.ac.nz>; Mon, 22 Mar 1993 12:48:09 +1300 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA17620; Mon, 22 Mar 93 11:47:43 +1200 Date: 22 Mar 1993 11:47:43 +1200 From: cristian@cs.aukuni.ac.nz Subject: Re: To: "Svozil Karl, Ph.D." <@cunyvm.cuny.edu:E1360DAB@AWIUNI11.bitnet> Message-id: <9303212347.AA17620@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Professor Svozil, Many thanks for your kind message. I am looking forward receiving your book in hard copy. Also, I would be very grateful to receive reprints of your early work pertaining randomness and complexity (including the papers quoting my '88 book). I will be glad to mail you a selection of my papers; just be kind and send me your full address in Wienna. My book is written in Latex; please let me know in what format do you prefer to send you the draft part of chapters 2-5? Chapter 6 is now in the final process of polishing and chapter 7 (applications) will be finished after receiving your papers. Best regards and good luck for your project! Cris ....................... Cristian Sorin Calude Computer Science Department The University of Auckland Private Bag 92019 Auckland, New Zealand Tel. +64 - 9 - 373 -7599 ext. 5751 Fax : +64 - 9 - 373 - 7453 Email: cristian@cs.auckland.ac.nz ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:Young_S_KIM@UMAILSRV0.UMD.EDU> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 3714; Tue, 23 Mar 1993 05:08:35 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 1531; Mon, 22 Mar 1993 23:07:35 -0500 Received: from umailsrv0.UMD.EDU by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Mon, 22 Mar 93 23:07:34 EST Received: by umailsrv0.UMD.EDU (5.57/Ultrix3.0-C) id AA15238; Mon, 22 Mar 93 23:06:05 -0500 Message-Id: <9303230406.AA15238@umailsrv0.UMD.EDU> Received: by umailsrv0.umd.edu, Mon, 22 Mar 93 23:06 EST Date: Mon, 22 Mar 93 22:55 EST From: Young_S_KIM@umail.umd.edu (yk5) Subject: Postdoc position at the Univ. of New Mexico To: kim@umdhep.umd.edu CENTER FOR ADVANCED STUDIES POSTDOCTORAL FELLOWSHIP Department of Physics and Astronomy University of New Mexico The University of New Mexico, Department of Physics and Astronomy, announces a Postdoctoral Fellowship at the Center for Advanced Studies (CAS). The Fellowship, to begin in the fall of 1993, is for one year with renewal for a second year contingent upon funding and satisfactory progress. The CAS Fellow will be expected to participate in the CAS research program in theoretical quantum optics and the physics of information. Applicants should submit a curriculum vitae and a statement of research interests and plans and should arrange for three letters of recommendation. These application materials should be directed to Professor Carlton M. Caves Center for Advanced Studies University of New Mexico Albuquerque, NM 87131-1156 U.S.A. by 1993 May 3. The University of New Mexico is an Equal Opportunity/Affirmative Action employer. ----------------------------------------------------------------------- Copied from the announcement released by the Department of Physics and Astronomy, University of New Mexico (1993 March 12). ======================================================================== 11 Date: Tue, 23 Mar 93 10:40:00 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Professor Calude: would it be OK for you if I send you a Postscript form of your file, printable on any 300 dpi laser printer (HP Laserjet, Lexmark et cetera?) The file is approximately 2.8 MB large. Best wishes & greetings, Karl Svozil ======================================================================== 7 Date: Tue, 23 Mar 93 10:42:53 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz There was a misspelling in my last e-mail: PostScript file of my book Best greetings| Karl ======================================================================== 20 Date: Wed, 24 Mar 93 13:46:43 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Professor Calude: I am unable to transmit the whole file (3+ MB) via e-mail. Please ftp to tph20.tuwien.ac.at (login-word: svozil, password: trebla) and fetch file test.ps. It should print OK. My address is: Karl Svozil Institute for Theoretical Physics TU Wien Wiedner Hauptstrasse 8-10/136 A-1040 Vienna, AUSTRIA If you have any LaTeX, DVI or PS files, I could process them here (if you dont use weird macros) as well. Best greetings, Karl ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 0978; Wed, 24 Mar 1993 01:42:38 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 2810; Tue, 23 Mar 1993 19:41:41 -0500 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Tue, 23 Mar 93 19:41:38 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GW6QIZ7IGG8Y5F1P@aukuni.ac.nz>; Wed, 24 Mar 1993 12:41:43 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA26225; Wed, 24 Mar 93 12:41:00 +1200 Date: 24 Mar 1993 12:41:00 +1200 From: cristian@cs.aukuni.ac.nz Subject: your book To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9303240041.AA26225@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz That's fine. I am waiting for it. Cheers, Cris PS Please let me know your address in order to send you some papers. ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 4821; Thu, 25 Mar 1993 04:29:17 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 6157; Wed, 24 Mar 1993 22:28:15 -0500 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Wed, 24 Mar 93 22:28:11 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GW8AMNWKE88Y8JEW@aukuni.ac.nz>; Thu, 25 Mar 1993 15:28:09 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA15565; Thu, 25 Mar 93 15:27:16 +1200 Date: 25 Mar 1993 15:27:16 +1200 From: cristian@cs.aukuni.ac.nz Subject: your book To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9303250327.AA15565@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Karl,I have printed here your book. It is very impressive: Congratulations. I wiil spend all week-end with it. I a few days I will send you my mail the draft form of chapters 2-6 of my book. Also, I will send you - via ordinary mail - some recent papers. Keep in touch, Cheers, Cris *********************************** Cristian Sorin Calude Computer Science Department The University of Auckland Private Bag 92019 Auckland, New Zealand Tel. +64 - 9 - 373 -7599 ext. 5751 Fax : +64 - 9 - 373 - 7453 Email: cristian@cs.auckland.ac.nz *********************************** ======================================================================== 25 Date: Thu, 25 Mar 93 11:13:19 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Cris: thanks for the message. The book may look impressive, but I hope it does not contain too many errors. Its my first one, and I am horrified by the thought that -- when you give it away -- you cant improve it any more. I am very much looking forward for any comment & suggestion. Probably the most unconventional chapter to digest is the one on extrinsic/intrinsic perception (view from the outside/inside of a system). You might not be very happy with the chapter on computational complementarity. I find anything connected to the busy beaver function fascinating; No one (to my knowledge) has ever translated these concepts to instantaneous codes. Also infinite computations are very fascinating; physical systems more resemble infinite computations than ones that halt. However, I am too weak formally to work on these topics. I dont wont to press you too hard, but you should be "predestinated" for research in this direction. Next week I shall be in Germany (Endophysics meeting, very exciting); please do not be bothered if I cannot answer mail immediately (they may have an internet connection in the old Bavarian castle, though). Best greetings & wishes, Karl ======================================================================== 12 Date: Mon, 05 Apr 93 13:37:19 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Cristian: many thanks for your re/preprints, which I just received. They look very interesting| Have you been so shocked by my book? I feared that when I am looking into my mail I am seeing some concerned remarks from your side expressing the preliminarity of chapters on AIT; the other chapters you could not read so far ... . -- but no mail is even more frightening| Is it that bad? Best wishes & greetings, Karl ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 0685; Thu, 25 Mar 1993 21:57:27 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 8148; Thu, 25 Mar 1993 15:56:15 -0500 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Thu, 25 Mar 93 15:55:47 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GW9B79TWSG8Y81PY@aukuni.ac.nz>; Fri, 26 Mar 1993 08:55:34 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA27135; Fri, 26 Mar 93 08:54:42 +1200 Date: 26 Mar 1993 08:54:42 +1200 From: cristian@cs.aukuni.ac.nz Subject: your book To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9303252054.AA27135@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Karl, Many thanks for your message. I will send you my *local* comments; the book looks very impresssive and I will learn a lot from it. Have a nice trip and keep in touch. I will prepare some macros to be used in wien to decode some of my Latex files. Cheers, Cris *********************************** Cristian Sorin Calude Computer Science Department The University of Auckland Private Bag 92019 Auckland, New Zealand Tel. +64 - 9 - 373 -7599 ext. 5751 Fax : +64 - 9 - 373 - 7453 Email: cristian@cs.auckland.ac.nz *********************************** ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 9006; Mon, 5 Apr 1993 23:31:27 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 4014; Mon, 5 Apr 1993 17:30:23 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Mon, 05 Apr 93 17:30:20 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GWOPMI4GDC8YAKN0@aukuni.ac.nz>; Tue, 6 Apr 1993 09:30:35 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA13092; Tue, 6 Apr 93 09:29:54 +1200 Date: 06 Apr 1993 09:29:54 +1200 From: cristian@cs.aukuni.ac.nz Subject: book To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9304052129.AA13092@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Karl, I was extremely busy the last week and I read only some parts of your book. Be sure, there nothing wrong and I really enjoy reading it. I like your book very much and all my comments will concern only "local" details. Be sure, that very soon there will be not mathematical unclear points in your book. Meantime I would like to kindly ask you to comment for me the paragraph on top page 1398 in van Lambalgen paper AIT (J. Symbolic Logic 54, 1989, 1389-1400) in which he contrasts randomness in physics with randomness in math. I do not feel he is right, but I would like to know the opinion of an expert in physics. Best regards, Cris Cristian Sorin Calude | Email: cristian@cs.aukuni.ac.nz Computer Science Department | cristian@cs.auckland.ac.nz University of Auckland | Phone: +64-9-373-7599 x 5751 Private Bag 92019, Auckland, New Zealand | Fax: +64-9-373-7453 ======================================================================== 33 Date: Tue, 06 Apr 93 17:30:49 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Cris: thank you for the encouraging remarks! I am looking forward for any comments & critique from your side. Since I only posess the preprint of van Lambalgen's article ``AIT,'' I can only assume that you are alluding to his remark ``In any case, I believe that the analogy with nonlinear dynamics and quantum mechanics is rather farfetched. ...'' I know Michiel personally; and it is very much a pity that his polemics with respect to Greg Chaitin and AIT is so unjust. In other words: personally, Michiel is a very nice guy, but my impression is that he is overstating his critique. As far as the application of AIT to physics is concerned, I believe (and I have expressed that in the book) that algorithmic randomness is a wonderful formalisation of the intuitive physical notions; in particular lawlessness <-> nonrecursivity and randomness <-> algorithmic incompressibility. I think that AIT is a proper theory to cope with physical phenomena -- by the way, in his dissertation [JSL 52, 725 (1987)], Michiel is doing just that: he is applying AIT to statistical physics and his theorem 5.2 (p. 750) is important for the physics of nonlinear systems. Best greetings & wishes, Karl. PS: do you plan any travel to Europe? Please let me know; I might be able to arrange something for you here -- probably a seminar talk at the Goedel Colloquium and a per diem. ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 7327; Wed, 7 Apr 1993 07:38:54 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 5779; Wed, 7 Apr 1993 01:37:54 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Wed, 07 Apr 93 01:37:49 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GWQKY4W3KW8YAQRD@aukuni.ac.nz>; Wed, 7 Apr 1993 17:38:00 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA00259; Wed, 7 Apr 93 17:37:18 +1200 Date: 07 Apr 1993 17:37:18 +1200 From: cristian@cs.aukuni.ac.nz Subject: comments on your book To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9304070537.AA00259@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Karl, Thank you very much for you letter and comments. Also, many thanks for your kind proposal. I plan to visit Europe on June-July, but I am afraid that all arrangements are done now and cannot be changed. I will visit Zurich, Bucharest and finally I will attend a conference in Turku, Finland and do some joint work with Arto Salomaa. My next trip will be in USA + Canada and I will be back for a month in Europe in January-February '94 [I am an invited speaker for a symposium in Germany]. I will be delighted to come to Vienna and see you. Many thanks. Also, if you are interested, you may want to visit Auckland and give here some talks. I may arrange things (jointly with the Physics department). But, probably, your schedule is also very tight and we may have to pospone theses arrangements for the next year. Now, let discuss a bit your book. Going through it was a real pleasure and also very instructive. I have learnt not only thinks in physics, but I was inspired by your formulation of a result of Pour-El which will be very soon used in a paper on random numbers. Of course, credit to your book will be given in that paper and a copy of it will be sent to you. The following comments pertain only the first part of your book,"Algorithmic physics: the Universe as a computer". The other part will be commented in a few days [I use to read with pen and paper my books/papers, so it takes a bit longer than usual]. page 3: I think that you should quote also the following [very nice] book: P.Odifreddi. {\em Classical Recursion Theory}, North-Holland, Amsterdam, New York, Oxford, Tokyo, Vol.1, 1989; Vol. 2 [in preparation]. It is, in my opinion, the modern version of Rogers' book. page 8: The first example of a recursive function which is not primitive recursive was obtained independently by Akcermann (Math. Ann 99(1928),118-133) and the romanian of Swiss origin G.Sudan (Bull. Math.Soc Roumaine des Sciences 30(1927),11-30). Some more fact are given in my joint paper: C.Calude, S.Marcus, I.Tevy. The first example of a recursive function which is not primitive recursive, Hist. Math. 6(1979), 380-384. It is interesting that these examples are not just math curiosities (they are very useful in compiler testing, for instance), but as I have proved in C.Calude. Relativized topological size of sets of partial recursive functions, {\em Theoret. Comput. Sci.} 87 (1991), 347-352 most recursive functions are not primitive recursive as most recursive reals are not algebraic (rational), as most reals are not recursive. page 10: we may want to cite some reference dealing with equations: Kleene's book is the classical reference, my TCS book is a new one. page 13: A detailed construction and study of recursive reals is going to appear in D.Bridges' book D.S.Bridges. {\em Computability --- A Mathematical Scketchbook}, Springer-Verlag, Berlin, 1993. [in print] page 17: replace in D.1.13 recursively enumerable function by (partial) recursive function. delete the right paranthesis from arithmetic) [the line after T.1.14] page 25: is the author of ref [26] W.Brauer ? page 31: you may want to cite Bishop-Bridges book (line one); ref [42] is strange since, as far as I know, Bishop died a couple of years ago. Is it '81 ? page 91: you may want to explain what do you understand by loop-depth complexity ? page 96: In ALL proofs in AIT one uses an infinite variation of Kraft's theorem (I call it Kraft-Chaitin Theorem) which extends the original condition to arbitrary infinite r.e. sets. This statement appears for the first time in Greg's paper [78], but a full treatment may be found in my joint paper C.Calude, Eva Kurta. On Kraft-Chaitin inequality, {\em Rev. Roumaine Math. Pures Appl.} 35(1990), 597-604.and especially in Chapter 4 of my forthcoming book [whose draft will be sent to you today]. page 97: Lie and Vit\'{a}yi should be written Li and Vit\'{a}nyi; the same for the bibliography. page 99: codes of program with ... should be codes of program which ... As a conclusion, your book is excellent and you should be proud of it. Congratulations. Soon I will be back with more comments. I am sending now a draft form of some parts (ch 2-6) of my book; also, you will see the titles of all sections of the book. Please send me any remarks, comments concerning it; I will be grateful to you. I will send you theree latex files: block.sty, proofbook.sty and b.tex. Please put all of them in the same directory. Best regards, Cris Cristian Sorin Calude | Email: cristian@cs.aukuni.ac.nz Computer Science Department | cristian@cs.auckland.ac.nz University of Auckland | Phone: +64-9-373-7599 x 5751 Private Bag 92019, Auckland, New Zealand | Fax: +64-9-373-7453 ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 7367; Wed, 7 Apr 1993 07:43:14 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 5910; Wed, 7 Apr 1993 01:42:17 -0400 ======================================================================== 25 Date: Wed, 07 Apr 93 12:39:51 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Cris: thank you VERY much for your comments & suggestions. I have included them all in my draft, although I have to admit that I cant get hold of the originals because the library here is unexpectedly closed the whole Wensday (|) I am also very much looking forward to receive the chapters of your book on Inf ormation and Randomness (I will cite it in my draft). Do you have already any publisher? ÜJohn Casti told me that he has been approached by Princeton UP and Academic Press if he knows of any books in preparation on these subjects.đ Please let mew know of any further comments to the second & third part of the b ook. As far as travel concerns, I am presently very much restricted by a very nice and lively baby (9 1/2 months old); so I hope that you would be able to come to Vienna. We could arrange something for your trip to Germany (freeeeezing Jan./Feb. 1994. Best wishes & greetiings, Karl ======================================================================== 6 Date: Wed, 07 Apr 93 12:57:22 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Cris: sorry, I did not realise that your book will appear at Springer Verl ag. Greetings, Karl ======================================================================== 8 Date: Wed, 07 Apr 93 14:50:13 MEZ From: "Svozil Karl, Ph.D." To: rebhana@hrz.uni-bielefeld.de Lieber Toni: meine bitnet-Adresse ist e1360dab at awiuni11 meine internet-Adresse ist e1360dab at awiuni11.edvz.univie.ac.at Einen guten Start in Bielefeld & herliche Gruesse| Karl ======================================================================== 7 Date: Wed, 07 Apr 93 16:05:35 MEZ From: "Svozil Karl, Ph.D." To: rebhana@hrz.uni-bielefeld.de Lieber Toni: danke fuer den Hinweis. Bin leider kein bulletin-board hacker; aber vielleicht hilft mir einer von den ``youngsters'' hier. Herzliche Gruesse, Karl ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:rebhana@HRZ.UNI-BIELEFELD.DE> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 3317; Wed, 7 Apr 1993 15:24:51 +0100 Received: from hermes.hrz.uni-bielefeld.de by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Wed, 07 Apr 93 15:24:49 MEZ Received: from dave.hrz.uni-bielefeld.de by hermes.hrz.uni-bielefeld.de with SMTP (16.8/16.2) id AA06908; Wed, 7 Apr 93 15:25:05 +0200 Received: by dave1.hrz.uni-bielefeld.de (1.37.109.4/16.2) id AA07014; Wed, 7 Apr 93 15:25:45 +0200 From: Anton K Rebhan Subject: test To: E1360DAB@helios.edvz.univie.ac.at (Karl Svozil) Date: Wed, 7 Apr 93 15:25:45 MESZ Full-Name: Anton K Rebhan Mailer: Elm [revision: 70.85] Servus Karl! Mir fehlte die genaue Internet-Adresse des Uni-Rechners, danke! Ich wollte Dir nur sagen, dass ich in einem der electronic bulletin boards ein abstract gesehen habe, in dem squeezed states in der Kosmologie, insbes. der Theorie kosmologischer Stoerungen, eine Rolle zu spielen scheinen. Falls es Dich interessiert: es ist im bulletin board gr-qc/9304001, ein Paper von Grishchuk. Schoene Ostern! Toni ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 2632; Wed, 7 Apr 1993 23:54:23 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 9294; Wed, 7 Apr 1993 17:53:23 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Wed, 07 Apr 93 17:53:20 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GWRIMXUAXC8Y9XP0@aukuni.ac.nz>; Thu, 8 Apr 1993 09:42:30 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA08698; Thu, 8 Apr 93 09:40:10 +1200 Date: 08 Apr 1993 09:40:10 +1200 From: cristian@cs.aukuni.ac.nz Subject: book To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9304072140.AA08698@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Karl, Congratulations for the baby! Long life to him/her ! Many thanks for the Vienna project: see you in Vienna next year. Yes, my book will be publish by Springer Verlag. I will mail it now, as the system is OK. I will be back to you very soon. Any comments will be appreciated. Very best regards, Cris Cristian Sorin Calude | Email: cristian@cs.aukuni.ac.nz Computer Science Department | cristian@cs.auckland.ac.nz University of Auckland | Phone: +64-9-373-7599 x 5751 Private Bag 92019, Auckland, New Zealand | Fax: +64-9-373-7453 ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 3216; Thu, 8 Apr 1993 00:35:25 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 1706; Wed, 7 Apr 1993 18:33:35 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Wed, 07 Apr 93 18:31:21 EST Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GWRK5PU6S08YASZ7@aukuni.ac.nz>; Thu, 8 Apr 1993 10:29:48 +1200 Received: from cs13.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA08707; Thu, 8 Apr 93 09:41:05 +1200 Received: by cs13.cs.aukuni.ac.nz (5.65/4.7) id AA04312; Thu, 8 Apr 1993 09:40:45 +1200 Date: 08 Apr 1993 09:40:45 +1200 From: cristian@cs.aukuni.ac.nz Subject: book To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9304072140.AA04312@cs13.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT \documentstyle[12pt,proofbook]{book} \pagestyle{myheadings} \sloppy \raggedbottom \newcommand{\propersubset}{\subset} \newcommand{\la}{\lambda} \newcommand{\f}{\varphi} \newcommand{\de}{\delta} \newcommand{\al}{\alpha} \newcommand{\be}{\beta} \newcommand{\e}{\in} \newcommand{\th}{\theta} \newcommand{\spq}{\stackrel{o}\rightarrow} \newcommand{\s}{\rightarrow} \newcommand{\N}{{\bf N}} \newcommand{\lessa}{\stackrel{+}\prec} \newcommand{\R}{{\bf R}} \newcommand{\x}{{\bf x}} \newcommand{\y}{{\bf y}} \newcommand{\z}{{\bf z}} \newcommand{\rem}{{\bf !!!! REMINDER }\\} \newcommand{\COM}[2]{{#1 \choose #2}} \newcommand{\Q}{{\bf Q}} \newcommand{\Z}{{\bf Z}} \newcommand{\m}{{\bf m}} \newcommand{\rand}{{\bf rand}} \begin{document} \end{document} ======================================================================== 8 Date: Thu, 08 Apr 93 12:25:27 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Cris: I just received & compiled your book. It looks very good| I will read it as soon as possible (possibly over easter). Hopefully I dont have to change too much in my my book after reading yours| Best greetings & wishes| Karl ======================================================================== 8 Date: Thu, 08 Apr 93 16:35:37 MEZ From: "Svozil Karl, Ph.D." To: tech-support@math.ams.com Dear TeX-ers: do you know of any kind of "blackbord bold" font 1 ? I would very much like to yuse it for identity (matrix) etc. My e-mail address is: e1360dab at awiuni11.edvz.univie.ac.at thank you very much. Yours sincerely, Karl Svozil ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:JUL@MATH.AMS.ORG> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 5405; Thu, 8 Apr 1993 17:23:10 +0100 Received: from vs3002.ams.org by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Thu, 08 Apr 93 17:23:08 MEZ Received: from MATH.AMS.ORG by MATH.AMS.ORG (PMDF #2306 ) id <01GWRM06R3UOHV1C2Y@MATH.AMS.ORG>; Thu, 8 Apr 1993 11:22:36 EST Date: 08 Apr 1993 11:22:36 -0400 (EDT) From: AMS Technical Support In-reply-to: <01GWRKNLSSR6HV1AHM@MATH.AMS.ORG> To: E1360DAB@AWIUNI11.EDVZ.UniVie.AC.AT Cc: tech-support@MATH.AMS.ORG Reply-to: tech-support@MATH.AMS.ORG Message-id: <734282556.312963.JUL@MATH.AMS.ORG> Content-transfer-encoding: 7BIT Mail-System-Version: This is to acknowledge receipt of your mail by the American Mathematical Society Technical Support group. A full reply will follow as soon as possible. The response time can vary considerably depending on the number of incoming questions, the amount of investigation required, and other demands on the time of the AMS Technical Support personnel. If you do not hear from us within two weeks, or if your question is extremely urgent, you may wish to contact us by telephone at 401-455-4080, Monday through Friday, 8:00 a.m. - 4:00 p.m. EST. Technical Support Staff American Mathematical Society tech-support@math.ams.org ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 3098; Mon, 12 Apr 1993 00:54:52 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 8484; Sun, 11 Apr 1993 18:54:49 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Sun, 11 Apr 93 18:54:46 EDT Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GWX6BR8OPS90MU9R@aukuni.ac.nz>; Mon, 12 Apr 1993 10:54:37 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA11426; Mon, 12 Apr 93 10:53:20 +1200 Date: 12 Apr 1993 10:53:20 +1200 From: cristian@cs.aukuni.ac.nz Subject: Re: To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9304112253.AA11426@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz No, you don't have to change anything. I will be back to you tomorrow with the last comments for you book. Cheers, Cris Cristian Sorin Calude | Email: cristian@cs.aukuni.ac.nz Computer Science Department | cristian@cs.auckland.ac.nz University of Auckland | Phone: +64-9-373-7599 x 5751 Private Bag 92019, Auckland, New Zealand | Fax: +64-9-373-7453 ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 8638; Tue, 13 Apr 1993 04:38:47 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 1646; Mon, 12 Apr 1993 22:38:46 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Mon, 12 Apr 93 22:38:40 EDT Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GWYSFFN6SG90MZ8T@aukuni.ac.nz>; Tue, 13 Apr 1993 14:38:21 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA25812; Tue, 13 Apr 93 14:36:59 +1200 Date: 13 Apr 1993 14:36:59 +1200 From: cristian@cs.aukuni.ac.nz Subject: your book To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9304130236.AA25812@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Karl, I have used the Easter time to read your book. My first impressions are fully confirmed: you have written a very nice book. Here are some local comments or questions: p. 135 and following E.M Gould should be written Gold p. 142 erver since[380] ever ... p. 213 is weakly Random ... is weakly random p. 214 D.14.1 Also, both notions of randomness are in fact equivalent (as it is later said; maybe you should warn the reader from the beginnig ?) Some references for the proofs wuold be usef, e.g. Greg AIT book. The relation between randomness and uncomputability is extensively discussed in my joint paper C.Calude, I.Chi\c{t}escu. Qualitative properties of P.Martin-L\"{o}f random sequences, {\em Boll. Unione Mat. Ital.} (7) 3 - B(1989), 229-240. Here is a sample result: the slightest possibility of computing an infinite part of a given sequence makes that sequence non random. For instance, if we can compute an infinity of entries in a sequence, no matter in which order, then the sequence is non random. Some more facts are presented in my IR book. p. 214 I suggest to change the letter K in (14.1) and following as it usually refers to Kolmogorov complexity. Also, the term string refers usually to a finite sequence and sequence is reserved to infinite sequence. (see The algorithmic information K(x) of a string x ...) p. 217 Bernoulli randomness corresponds to the property of Borel normality; Greg has first investtogated this property of his famous Omega number in G.J.Chaitin. On the length of programs for computing finite binary sequences: statistical considerations, {\em J. Assoc. Comput. Mach.} 16(1969), 145-159; recently, I have proved that all random sequences have this property: C.Calude. {\em Borel Normality and Algorithmic Randomness}, Technical Report, The University of Western Ontario, London, December 1992, 19 pp. (with a note by G.J.Chaitin) In this context it is interesting to note the example due to von Mises: take a binary sequence \[{\bf x} = x_{1}x_{2} \ldots x_{n} \ldots \] and construct the ternary sequence (over the alphabet $\{0,1,2\}$) \[{\bf y} = y_{1}y_{2} \ldots y_{n} \ldots \] where $y_{1}=x_{1}, y_{n}=x_{n-1}+x_{n}, n \geq 2$. Then, ${\bf y}$ is never random because the patterns $O2$ and $20$ do not appear in it! The above Calude-Chi\c{t}escu paper discusses this question within Chaitin- Martin-L\"{o}f theory of randomness. p. 223 cantor .. Cantor p. 248 overflow line 12 p. 245-246 - Your device generates {\em infinite} random sequences, but one may observe (and distribute by a burea of standards) only finite intial strings of these sequences! And sometimes, due to results by Greg and Martin-L\"{o}f, these strings may have "local" patterns, so they are not random (as strings!) So, question: Is it possible to generate, in your physical way, random strings? This may be more important, for all practical purposes. - Is there any connection between the assumption of randomness - invoked at page 248 (" ... this is ultimately guaranted by the assumption of unpredictability ...") - and the superstring theory as a candidate (?) for the Grand Unification Theory ? I end here my "local" comments and start with something more general. I find your mathematics extremely accurate and enjoy it. Your distinction extrinsic determinism versus intrinsic determinism is very nice and I presume that it deserves a more in depth study. I am particularly interested in your theses - I use to call them Svozil Theses - [ tomorrow I will give two talks in Hamilton about computational complexity and randomness in nature, so it will be the birthday of the notion ]: - Chaos in Physiscs menans randomness in Mathematics - Randomness in Physics means undecidability in Mathematics. As soon as I will have a bit of free time I will think more on the subject. Once again, Congratulations ! for your nice book. I wish you best luck with a fast publication of it and many nice feedbakcs (i.e. citations). I will be among the long line of authors quoting it. Best regards, Cris Cristian Sorin Calude | Email: cristian@cs.aukuni.ac.nz Computer Science Department | cristian@cs.auckland.ac.nz University of Auckland | Phone: +64-9-373-7599 x 5751 Private Bag 92019, Auckland, New Zealand | Fax: +64-9-373-7453 ======================================================================== 9 Date: Tue, 13 Apr 93 10:38:42 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Cris: thank you very much for your warm end encouraging Comments! And also many thanks for the reading and the corrections! Best wishes & greetings, karl ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:NGB@MATH.AMS.ORG> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 7965; Mon, 19 Apr 1993 21:16:02 +0100 Received: from vs3002.ams.org by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Mon, 19 Apr 93 21:15:58 MEZ Received: from MATH.AMS.ORG by MATH.AMS.ORG (PMDF #2306 ) id <01GX6X4NXS0WI8RIWL@MATH.AMS.ORG>; Mon, 19 Apr 1993 15:15:46 EST Date: 19 Apr 1993 15:15:46 -0400 (EDT) From: AMS Technical Support In-reply-to: <01GWRKNLSSR6HV1AHM@MATH.AMS.ORG> To: E1360DAB@AWIUNI11.EDVZ.UniVie.AC.AT Cc: tech-support@MATH.AMS.ORG Reply-to: tech-support@MATH.AMS.ORG Message-id: <735246946.537622.NGB@MATH.AMS.ORG> Content-transfer-encoding: 7BIT Mail-System-Version: Dear Karl Svozil: I am sorry, but we do not know of a set of Blackboard Bold numerals for use in TeX. In fact, a quick look through catalogs of proprietary PostScript and TrueType fonts did not reveal any such thing. It seems that most implementations of Blackboard Bold for use in Math include only uppercase alphabetic charactgers; a few include lowercase, and I have found none which include numerica characters. Sincerely, Neil Bartholomew Technical Support American Mathematical Society Phone: 800-321-4AMS (321-4267) or 401-455-4080 Internet: TECH-SUPPORT@MATH.AMS.ORG ======================================================================== 9 Date: Tue, 27 Apr 93 10:54:08 MEZ From: "Svozil Karl, Ph.D." To: gk@cfnext.physchem.chemie.uni-tuebingen.de Lieber George: danke fuer die References & das Band| Koenntest Du mir bitte noch Deine wichtigsten Arbeiten (Zitate) auflisten, damit ich Sie im Buch erwaehnen kann? Herlichen Dank| Karl ======================================================================== 18 Date: Tue, 27 Apr 93 13:51:55 MEZ From: "Svozil Karl, Ph.D." To: HAA@IBMA.ipp-garching.mpg.de Lieber Harald: herzlichen Dank fuer das Korrekturlesen und das Zusenden der Manuskriptkopie im Proceedings-Format. Habe noch einige kleinere Aenderungung, die allesamt etwa 1/2 - 3/4 Stunden zum Nachtragen erfordern. Deshalb waere es vielleict bes ser (um Dir diese Arbeit zu ersparen),wenn Du mir das bearbeitete File im Proce edings-Format schickst, sodass ich diese Aenderungen selbst machen kann. Ansonsten wuerde ich Dir die Aenderungen im TeX-Format ueber e-mail schicken. Herzliche Gruesse und vielen Dank, auch nochmals fuer die Einladung zu dieser sehr interessanten Tagung| Karl PS.: ich lese gerade mit grossem Vergnuegen "Forschen auf Deutsch" von S. B{r. Kennst Du das Buch? ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:gk @CFNEXT.PHYSCHEM.CHEMIE.UNI-TUEBINGEN.DE> Received: from DKAUNI2 (NJE origin MAILER@DKAUNI2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 1092; Tue, 27 Apr 1993 09:41:19 +0100 Received: (from DKAUNI2 for via BSMTP) : Received: (from SMTP@DKAUNI2 for MAILER@DKAUNI2 via NJE) (UCLA/Mail V1.500 M-SMTP-7647-67); Tue, 27 Apr 93 09:40:04 Received: from nz11.rz.uni-karlsruhe.de by ibm3090.rz.uni-karlsruhe.de (IBM MVS SMTP V2R2.1) with TCP; Tue, 27 Apr 93 09:39:57 MET Received: from mailserv.zdv.uni-tuebingen.de by nz11.rz.uni-karlsruhe.de with SMTP (PP) id <26356-0@nz11.rz.uni-karlsruhe.de>; Tue, 27 Apr 1993 09:40:28 +0200 Received: from cfnext.physchem.chemie.uni-tuebingen.de by mailserv.zdv.uni-tuebingen.de (4.1/ZDV-Uni-Tuebingen-1.0) id AA08473; Tue, 27 Apr 93 09:40:22 +0200 Received: by cfnext.physchem.chemie.uni-tuebingen.de id AA22328 (5.65c/IDA-1.4.4 for e1360dab@awiuni11.bitnet); Tue, 27 Apr 1993 09:38:51 +0100 Date: Tue, 27 Apr 1993 09:38:51 +0100 From: George Kampis Message-Id: <199304270838.AA22328@CFNEXT.PHYSCHEM.CHEMIE.UNI-TUEBINGEN.DE> To: e1360dab@AWIUNI11.BITNET Subject: refernces etc Hallo Karl, entschuldige bitte fuer die Verspaetung, ich war schwer belastet. hier sind ein Paar Zitaten zum Thema Komplexitaet die ich Dir versprochen habe. Von Loefgren die besten sind sein 1987 Enyclopedia paper, sein 1977 und besonders sein 1972! Sein 1967 ist ein Beweis dass er dabai war als das Ganze angefangen hat. Der Lovasz paper konnte ich nicht finden. er ist bei mir in Budapest. In dem Paper schreibt er dass es keine obere Grenzen fuer computation time gibt fuer ein Programm mint Kompleitaet n. Viellicht ist das im Li and Vitanyi rekapituliert! Das Herken Interview habe ich fuer Dich gesendet mit der heutigen Post. Seine email Addresse lautet rolf@mental.de Hoffe dass es hilft. mfg gk Lfgren, L. 1967: Recognition of Order and Evolutionary Systems, in: Proc. 2nd Symp. on Computer and Inf. Sci., Batelle Memorial Inst. (ed.: Tou, J.). Lfgren, L. 1968: An Axiomatic Explanation of Complete Self- Reproduction, Bull.Math.Biophys. 30, 415-425. Lfgren, L. 1972: Relative Explanations of Systems, in: Trends in General Systems Theory (ed.: Klir, G.J.), Wiley, New York, pp. 340-407. Lfgren, L. 1977: Complexity of Decriptions of Systems: A Foundational Study, Int.J.General Systems 3, 197-214. Lfgren, L. 1987: Complexity of Systems, in: Systems and Control Encyclopedia (ed.: Singh, M.), Pergamon, Oxford, pp. 704- 709. Lfgren, L. 1987: The Partiality of Self-Reference, in: Self- Steering and Cognition in Complex Systems (ed.: Rosseel, E.). Lfgren, L. 1988: Towards System: From Computation to the Phenomenon of Language, in: Nature, Cognition, and Systems I., (ed.: Carvallo, M.), Kluwer, Dordrecht. ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:gk @CFNEXT.PHYSCHEM.CHEMIE.UNI-TUEBINGEN.DE> Received: from DKAUNI2 (NJE origin MAILER@DKAUNI2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 3665; Fri, 30 Apr 1993 10:23:44 +0100 Received: (from DKAUNI2 for via BSMTP) : Received: (from SMTP@DKAUNI2 for MAILER@DKAUNI2 via NJE) (UCLA/Mail V1.500 M-SMTP-2739-53); Fri, 30 Apr 93 10:12:16 Received: from nz11.rz.uni-karlsruhe.de by ibm3090.rz.uni-karlsruhe.de (IBM MVS SMTP V2R2.1) with TCP; Fri, 30 Apr 93 10:12:12 MET Received: from mailserv.zdv.uni-tuebingen.de by nz11.rz.uni-karlsruhe.de with SMTP (PP) id <02816-0@nz11.rz.uni-karlsruhe.de>; Fri, 30 Apr 1993 10:05:47 +0200 Received: from cfnext.physchem.chemie.uni-tuebingen.de by mailserv.zdv.uni-tuebingen.de (4.1/ZDV-Uni-Tuebingen-1.0) id AA24392; Fri, 30 Apr 93 10:12:43 +0200 Received: by cfnext.physchem.chemie.uni-tuebingen.de id AA26438 (5.65c/IDA-1.4.4 for e1360dab@awiuni11.bitnet); Fri, 30 Apr 1993 10:10:21 +0100 Date: Fri, 30 Apr 1993 10:10:21 +0100 From: George Kampis Message-Id: <199304300910.AA26438@CFNEXT.PHYSCHEM.CHEMIE.UNI-TUEBINGEN.DE> To: e1360dab@AWIUNI11.BITNET Subject: refs Hi Karl, hier sind ein Paar Zitaten von mir... das beste Paper von mir is der "Two Approaches", as ist aber voellig nontechnisch. Das 1991 Buch und das 1993 Paper sind aber technisch, das erste hat ein langes Kapitel ueber Komplexitaet. Das Zweite beschreibt ein Komputer-Modell. Danke, hzl Gru3, george ========================== Kampis, G. 1989: Two Approaches for Defining 'Systems', Int.J.General Systems 15, 75-80. Kampis, G. 1991: Self-Modifying Systems: A New Framework for Dynamics, Information, and Complexity, Pergamon, Oxford-New York, pp 543+xix. Kampis, G. 1992: Process, Information Theory, and the Creation of Systems, in: Evolution of Information Processing (ed. K. Haefner), Sringer, Berlin, pp. 83-103. Kampis, G. 1992: Information: Course and Recourse, in: Nature and the Evolution of Information Processing (ed. K. Haefner), Springer, pp. 49-63. Kampis, G. 1993: Life-Like Computing Beyond the Machine Metaphor, in: Computing with Biological Metaphors (Paton, R. ed.), Chapman and Hall, London, in press.  ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:SOMMER@PS1.IAEE.TUWIEN.AC.AT> Received: from AWIUNI11 (NJE origin SMTP@AWIUNI11) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 3720; Tue, 4 May 1993 10:34:42 +0100 Received: from ss1.iaee.tuwien.ac.at by AWIUNI11.EDVZ.UniVie.AC.AT (IBM VM SMTP V2R2) with TCP; Tue, 04 May 93 10:34:15 MEZ Received: from pc26.iaee.tuwien.ac.at by ss1.iaee.tuwien.ac.at (4.1/SMI-4.1) id AA01180; Tue, 4 May 93 10:33:58 +0200 Received: From IAEE_CAD/WORKQUEUE by pc26.iaee.tuwien.ac.at via Charon-4.0-VROOM with IPX id 100.930504103338.320; 04 May 93 10:34:00 -200 Message-Id: To: e1360dab@awiuni11.edvz.univie.ac.at From: SOMMER@ps1.iaee.tuwien.ac.at Date: 4 May 93 10:33:23 CET Subject: topologische Feldtheorien Priority: normal X-Mailer: Pegasus Mail v2.3 (R5). ======================================================================== 13 Date: Thu, 13 May 93 17:12:12 MEZ From: "Svozil Karl, Ph.D." To: rcpt@heitue5 Dear Piet: I am enjoying PS2PK very much. Do you just by chance know if it is possible to convert the fonts which come with CoralDraw (*.wfm-format) into *.pfb format (the MwFmanager isnt working)? I would need a Garamond (compatible) font. Thank you for your attention and efforts. Karl Svozil (e1360dab at awiuni11.bitnet) ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:HAA@IBMA.IPP-GARCHING.MPG.DE> Received: from IBM.GWDG.DE (NJE origin MAILER@DGOGWDG1) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 6559; Mon, 24 May 1993 16:16:42 +0100 Received: from DGOGWDG1 by IBM.GWDG.DE (Mailer R2.08) with BSMTP id 4510; Mon, 24 May 93 14:54:12 MSZ Received: from nsat.ipp-garching.mpg.de by ibm.gwdg.de (IBM VM SMTP R1.2.2MX) with TCP; Mon, 24 May 93 14:53:37 MSZ Received: from ibma.ipp-garching.mpg.de by nsat.ipp-garching.mpg.de (AIX 3.2/UCB 5.64/4.03) id AA18004; Mon, 24 May 1993 14:53:49 +0200 Message-Id: <9305241253.AA18004@nsat.ipp-garching.mpg.de> Received: from DGAIPP1S.EARN by IBMA.ipp-garching.mpg.de (IBM VM SMTP V2R1) with BSMTP id 5605; Mon, 24 May 93 14:53:16 MSZ Received: by DGAIPP1S (Mailer R2.08) id 1231; Mon, 24 May 93 14:53:08 MSZ Date: Mon, 24 May 93 14:51:36 MSZ From: HAA@IBMA.ipp-garching.mpg.de To: karl svozil Hallo Karl: hier das Manuskript. Ich hoffe, es ist alles vollstaendig. Harald \def\l{$\lbrack} \def\r{\rbrack$} \def\R{\Bbb R} \def\N{\Bbb N} \def\Q{\Bbb Q} \def\C{\Bbb C} \def\Z{\Bbb Z} \maintitle{Extrinsic-Intrinsic Concept and Complementarity} \author{Karl Svozil} \address{Institut f\"ur Theoretische Physik, Technische Universit\"at Wien, \newline Wiedner Hauptstra\ss e 8--10/136, A--1040 Wien} \titlea{1.}{Introduction} Epistemologically, the {\it intrinsic/extrinsic} concept, or, by another naming \l1$-$3\r, the {\it endo\-phy\-sics/exophysics} concept, is related to the question of how a mathematical or a logical or an algorithmic universe is perceived from within/from the outside. The physical universe, by definition, can be perceived from within only. {\it Extrinsic} or {\it exophysical} perception can be conceived as a hierarchical process, in which the system under observation and the experimenter form a two-level hierarchy. The system is laid out and the experimenter peeps at every relevant feature of it without changing it. The restricted entanglement between the system and the experimenter can be represented by a one-way information flow from the system to the experimenter; the system is not affected by the experimenter's actions. (Logicians might prefer the term {\it meta} over {\it exo}.) {\it Intrinsic} or {\it endophysical} perception can be conceived as a non-hierarchical effort. The experimenter is part of the universe under observation. Experiments use devices and procedures which are realizable by internal resources, i.e., from within the universe. The total integration of the experimenter in the observed system can be represented by a two-way information flow, where ``measurement apparatus'' and ``observed entity'' are interchangeable and any distinction between them is merely a matter of intent and convention. Endophysics is limited by the self-referential character of any measurement. An intrinsic measurement can often be related to the paradoxical attempt to obtain the ``true'' value of an observable while --- through interaction --- it causes ``disturbances'' of the entity to be measured, thereby changing its state. Among other questions one may ask, {\it ``what kind of experiments are intrinsically operational and what type of theories will be intrinsically reasonable?''} Imagine, for example, some artificial intelligence living in a (hermetic) cyberspace. This agent might develop a ``natural science'' by performing experiments and developing theories. Since in cyberspace only {\it syntactic} structures are relevant, one might wonder if concerns of this agent about its ``hardware basis,'' e.g., whether it is ``made of'' billard balls, electric circuits, mechanical relays or nerve cells, are mystic or even possible (cf. H. Putnam's brain-\-in-\-a-\-tank analysis \l4\r). I do not think this is necessarily so, in particular if the agent could influence some features of this hardware basis. (One example is a possible hardware damage certain computer viruses cause by effectively ``heating up'' computer components such as storage or processors.) It is tempting to speculate that also a figure in a novel, imagined by the poet and the reader, is such an agent. No attempt is made here to (re-)write a comprehensive history of related concepts; but a few hallmarks are mentioned without claim of completeness. Historically, Archimedes conceived {\it ``points outside the world, from which one could move the earth.''} Archimedes' use of ``points outside the world'' was in a mechanical rather than in a metatheoretical context: he claimed to be able to move any given weight by any given force, however small. The 18th century physicist B.J.~Boscovich realized that it is not possible to measure motions or transformations if the whole world, including all measurement apparata therein, becomes equally affected by these motions or transformations (cf.~O.E.~R\"ossler \l2\r, p.~143). Fiction writers informally elaborated consequences of intrinsic perception. Edwin A.~Abbott's {\it Flatland} describes the life of two- and onedimensional creatures and their confrontation with higher dimensional phenomena. The {\it Freiherr von M\"unchhausen} rescued himself from a swamp by dragging himself out by his own hair. Among contemporary science fiction authors, D.F.~Galouye's {\it Simulacron Three} and St.~Lem's {\it Non Serviam} study some aspects of artificial intelligence in what could be called ``cyberspaces.'' Media artists such as Peter Weibel create ``virtual realities'' or ``cyberspaces'' and are particulary concerned about the {\it interface} between ``reality'' and ``virtual reality,'' both practically and philosophically. Finally, by outperforming television and computer games, commercial ``virtual reality'' products might become very big business. From these examples it can be seen that concepts related to intrinsic perception may become fruitful for physics, the computer sciences, and art as well. Already in 1950 (19 years after the publication of G\"odel's incompleteness theorems), K.~Popper has questioned the completeness of self-referential perception of ``mechanic'' computing devices \l5\r. Popper uses techniques similar to Zeno's paradox (which he calls ``paradox of Tristram Shandy'') and ``G\"odelian sentences'' to argue for a kind of ``intrinsic indeterminism.'' In a pioneering study on the theory of (finite) automata, E.F.~Moore has presented {\it Gedanken-experiments on sequential machines} \l6\r. Moore investigated automata featuring, at least to some extent, similarities to the quantum mechanical uncertainty principle. In the book {\it Regular Algebra and Finite Machines} \l31\r, J.H.~Conway has developed these ideas further from a formal point of view without relating them to physical applications. Probably the best review of experiments on Moore-type automata can be found in W. Bauer's book {\it Automatentheorie} \l19\r\ (in German). D.~Finkelstein \l32,33\r\ has considered Moore's findings from a more physical point of view, introducing an ``experimental logic of automata'' and the term {\it ``computational complementarity.''} An illuminating account on endophysics topics can be found in R\"ossler's article on {\it Endophysics} \l1\r, as well as in his book {\it Endophysik} (in German) \l2\r; O.E.~R\"ossler is a major driving force in this area. Also H.~Primas has considered endophysical and exophysical descriptions in various contexts \l7\r. The terms {\it ``intrinsic''} and {\it ``extrinsic''} appear in the author's studies on intrinsic time scales in arbitrary dispersive media \l8$-$10\r. There, the intrinsic-extrinsic concept has been re-invented (probably for the 100th time, and, I solemnly swear) independently. It is argued that, depending on dispersion relations, creatures in a ``dispersive medium'' would develop a theory of coordinate transformation very similar to relativity theory. Another proposal by the author was to consider a new type of ``dimensional regularization'' by assuming that the space-time support of (quantum mechanical) fields is a fractal \l11\r. In this approach one considers a fractal space-time of Hausdorff dimension $D=4-\epsilon$, with $\epsilon \ll 1$, which is embedded in a space of higher dimension, e.g., $\R^{n\ge 4}$. Intrinsically, the (fractal) space-time is perceived ``almost'' as the usual fourdimensional space. Besides such considerations, J.A.~Wheeler \l12\r, among others, has emphasized the role of {\it observer-participancy.} In the context of what is considered by the Einstein-Podolsky-Rosen argument \l13\r\ as ``incompleteness'' of quantum theory, A.~Peres and W.H.~Zurek \l14,15\r\ and J.~Rothstein \l16\r\ have attempted to relate quantum complementarity to G\"odel-type incompleteness. In what follows, the intrinsic-extrinsic concept will be made precise in an {\it algorithmic} context, thereby closely following E.F.~Moore \l6\r. The main reason for the algorithmic approach is that algorithmic universes (or, equivalently, formal systems) are the royal road to the study of undecidability. The intrinsic-extrinsic concept will be applied to investigate both {\it computational complementarity} and {\it intrinsic indeterminism} in the algorithmic context. \titlea{2.}{Gedankenexperiments on Finite Automata} In a groundbreaking study \l6\r, Edward Moore analysed two kinds of {\it Ge\-dan\-kenexperiments} on finite automata, which will be slightly adapted for the present purposes. In both cases, the automaton is treated as a ``black box'' in the following sense: {\it (i)} only the input and output terminals of the automaton are accessible. The experimenter is allowed to perform experiments {\it via} these interfaces in the form of stimulating the automaton with input sequences and receiving output sequences from the automaton. The experimenter is not permitted to ``open up'' the automaton, but {\it (ii)} the transition and output table (diagram) of the automaton (in its reduced form) is known to the experimenter (or, if you prefer, is given to the experimenter by some ``oracle''). A most important problem, among others, is the {\it distinguishing problem}. It is known that an automaton is in one of a particular class of internal states. The problem is: find that state. In the first kind of experimental situation, only a {\it single} copy of the automaton is accessible to the experimenter. The second type of experiment operates with an {\it arbitrary number} of automaton copies. Both cases will be discussed in detail below. If the input is some {\it predetermined} sequence, one may call the experiment a {\it preset experiment}. If, on the other hand, (part of) the input sequence depends on (part of) the output sequence, i.e., if the input is {\it adapted} to the reaction of the automaton, one may call the experiment an {\it adaptive experiment.} We shall be mostly concerned with preset experiments, yet adaptive experiments can be used to solve certain problems with automaton propositional calculi. Research along these lines has been pursued by S. Ginsburg \l17\r, A.~Gill \l18\r, J.H.~Conway \l31\r, and W.~Bauer \l19\r. \titleb{2.1}{Single-Automaton Configuration} In the first kind of Gedankenexperiment, only {\it one single} automaton copy is presented to the experimenter. The problem is to determine the initial state of the automaton, provided its transition and output functions are known (distinguishing problem). In a typical experiment, the automaton is ``fed'' with a sequence of input symbols and responds by a sequence of output symbols. An input-output analysis then reveals information about the automaton's original state. Assume for the moment that such an experiment induces a state transition of the automaton. I.e., after the experiment, the automaton is not in the original initial state. In this process a loss of potential information about the automaton's initial state may occur. In other words: certain measurements, while measuring some particular feature of the automaton, may make impossible the measurement of other features of the automaton. This irreversible change of the automaton state is one aspect of the ``observer-participancy'' in the single-automaton configuration. (This is not the case for the multi-automaton situation discussed below, since the availability of an arbitrary number of automata ensures the possibility of an arbitrary number of measuring processes.) \begfigside 4cm 8cm \figure{1.}{Schematic diagram of an experiment on a single automaton, both located within a ``meta"-automaton.} \endfigside In developing the intrinsic concept further, the automaton and the experimenter are ``placed'' into a {\it single} ``meta''-automaton. If the experimenter reacts mechanically, this can be readily achieved by simulating both the original finite deterministic ``black box'' automaton as well as the experimenter and their interplay by a universal automaton. One can imagine such a situation as one subprogram checking another subprogram, also including itself. For an illustration see Fig.~1. In certain cases it is necessary to iterate this picture in the following way. Suppose, for instance, the experimenter attempts a {\it complete} intrinsic description. Then, the experimenter has to give a complete description of his own intrinsic situation. In order to be able to model the own intrinsic viewpoint, the experimenter has to introduce another system which is a {\it replica} of its own universe. This amounts to substituting the ``meta''-automaton for the automaton in Fig.~1. Compare also a drawing by O.E.~R\"ossler \l3\r, Fig.~2, % \ref{l:rossl}, where ``$\approx $'' stands for the interface, which is denoted by the symbols ``$\rightleftarrows $'' throughout this article. \begfigside 4cm 8cm \figure{2.}{Author's notes from a seminar talk by O.E.~R\"ossler.} \endfigside Yet, in order to be able to model intrinsic viewpoint of a new experimenter in this new universe, this new experimenter has to introduce another system which is a {\it replica} of its own universe, $\ldots$, resulting in an iteration {\it ad infinitum.} One may conjecture that an observer in a hypothetical universe corresponding to the ``fixed point'' or ``invariant set'' of this process has complete self-comprehension; see Fig.~3. %ref{l.fiss}. \begfig 8cm \figure{3.}{Hierarchy of intrinsic perception.} \endfig Of course, in general this observer cannot be a finite observer: a complete description would only emerge in the limit of infinite iterations (cf. K. Popper's {``paradox of Tristram Shandy''}). Finite observers cannot obtain complete self-comprehension. \titleb{2.2}{Multi-Automata Configuration} The second kind of experiment operates with an {\it arbitrary number} of automaton copies. One automaton is a copy of another if both automata are isomorphic and if both are in the same initial state. With this configuration the experimenter is in the happy condition to apply as many input sequences to the original automaton as necessary. In a sense, the observer is not bound to ``observer-participancy,'' because it is always possible to ``discard the used automaton copies,'' and take a ``fresh'' automaton copy for further experiments. For an illustration, see Fig.~4. \begfig 4.5cm \figure{4.}{Schematic diagram of an experiment on an arbitrary number of identical automaton copies.} \endfig \titlea{3.}{Definition} In the foregoing section, important features of the extrinsic-intrinsic concept have been isolated in the context of finite automata. A generalization to arbitrary physical systems is straightforward. The features will be summarized by the following definition. (Anything on which experiments can be performed will be called {\it system}. In particular, finite automata are systems.) An {\it intrinsic} quantity is associated with an experiment \newline {\it (i)} performed on a {\it single copy} of the system, \newline {\it (ii)} with the experimenter being part of the system. An {\it extrinsic} quantity, denoted by ``$\tilde{\quad}$'' is associated with an experiment \newline {\it (i)} utilizing, if necessary, an {\it arbitrary number of copies} of the system, \newline {\it (ii)} with the experimenter not being part of the system. One may ask whether, intuitively, the extrinsic point of view might be more appropriately represented by, stated pointedly, the application of a ``can-opener'' for the ``black box'' to see ``what is really in it.'' Yet, while the physical realization might be of some engineering importance, the primary concern is the phenomenology (i.e., the {\it experimental performance} of the system) and not how it is constructed. In this sense, the technological base of the automaton is irrelevant. For the same reason, i.e., because this is irrelevant to phenomenology, it is not important whether the automaton is in its minimal form. The requirement that in the extrinsic case an {\it arbitrary} number of system copies is available is equivalent to the statement that {\it no interaction takes place between the experimenter and the system}. (The reverse information flow from the observed system to the experimenter is necessary.) This results in a one-way information flow in the extrinsic case: \def\A{\hbox{$\; \;$\rlap{/}\kern-.60em $\Longleftarrow$}} $$ {\rm system}\ \eqalign{&\Rightarrow \cr &\nLeftarrow }\ {\rm experimenter}, $$ and a two-way information flow in the intrinsic case: $$ {\rm system} \Longleftrightarrow {\rm experimenter}. $$ An information ``backflow'' makes possible the application of diagonalization techniques and also results in complementarity, which might be seen as a ``poor man's version of diagonalization.'' The definition applies to physical systems as well as to logics and (finite) automata. Automaton worlds provide an ideal ``playground'' for the study of certain algorithmic features related to undecidability, such as ``computational complementarity'' and ``intrinsic indeterminism.'' The {\it extrinsic-intrinsic problem} concerns the interrelation between extrinsic and intrinsic entities. \titlea{4.}{Complementarity} The input-output analysis of finite automata yields a fresh insight into the quantum mechanical feature of complementarity on a very elementary level. Conversely, the Copenhagen interpretation of quantum mechanics \l20,21\r\ can be applied for the analysis of automata. To substantiate this claim it is necessary to interrelate two strains of investigation: (i) the lattice theoretic \l22\r\ approach for a representation of quantum physics, pioneered by G.~Birkhoff and J.~von Neumann \l23\r\ and later extended to the calculus of propositions \l24,25\r\ and orthomodular logic \l26$-$29\r; (ii) the theory of finite automata, in particular of Moore and Mealy automata \l6,19,30,31\r. Computational complementarity in the automata context has been first investigated by E.F.~Moore in his article {\it Gedanken-Experiments on Sequential Machines} \l6\r. Informally stated, measurement of one aspect of an automaton makes any measurement of another aspect impossible and {\it vice versa}. The notion {\it computational complementarity} is due to D.~Finkelstein \l32,33\r, who also made the first attempt to construct logics from experimentally obtained propositions about automata; see also the more recent investigation by A.A.~Grib and R.R.~Zapatrin \l34\r. The following investigation has been carried out independently. Although the goals are very similar, the methods and techniques used here differ from the ones used by previous authors. The investigation is based on the construction of primitive {\it experimental statements} or {\it propositions.} Then the {\it structure} of these propositions will be discussed, thereby defining algebraic relations and operations between the propositions. Although specific classes of finite automata will be analyzed, these considerations apply to universal computers as well. (Finite automata can be simulated on universal computers.) \titleb{4.1}{Finite Automata} A {\it finite (i,k,n)-automaton} has a finite number of $i$ internal states, $k$ input and $n$ output symbols. It is characterized by its transition and output functions $\delta$ and $o$, which are often represented by transition and output tables and by a diagram. For an example see below. The output function of a {\it Moore-type automaton} depends solely on its internal state, whereas the output function of {\it Mealy-type automata} depends on the input and the internal state. \titleb{4.2}{Automaton Propositional Calculi} A finite automaton will be treated as a ``black box,'' whose transition and output tables (i.e., informally speaking, its ``intrinsic machinery'') are given in advance, but {\it whose initial state is unknown.} Only {\it a single} copy of the automaton will be made available to the experimenter. The automaton is ``fed'' with certain input sequences from the experimenter and responds with certain output sequences. We shall be interested in the {\it distinguishing problem}: {\it ``identify an unknown initial state.''} Consider propositions of the form $$ ``{\tt the\ automaton\ is\ in\ state\ } a_j" $$ with ($1\le j\le i$). Propositions can be composed to form expressions of the form $$ ``{\tt the\ automaton\ is\ in\ state\ } a_j\ {\tt or\ in\ } a_m\ {\tt or\ in\ } a_l \dots" $$ Any proposition composed by propositions can be represented by a set. E.g., the above statement ``{\tt the automaton is in state} $a_j$ {\tt or in} $a_m$ {\tt or in} $a_l \dots $'' represents the set $\{j,m,l,\ldots\}$. The element ${\bf 1}$ is given by the set of {\it all} states $\{ 1, 2,\ldots ,i\}$. This corresponds to a proposition which is always satisfied: $$ ``{\tt the\ automaton\ is\ in\ some\ internal\ state}" $$ The element ${\bf 0}$ is given by the {\it empty} set $\emptyset$ (or $\{\}$). This corresponds to a proposition which is false (by definition the automaton has to be in {\it some} internal state): $$ ``{\tt the\ automaton\ is\ in\ no\ internal\ state}" $$ The class of all propositions and their relations will be called {\it automaton propositional calculus} and denoted by ${\frak A}$. Each particular outcome which, if defined, has the value ${\tt TRUE}$ or ${\tt FALSE}$, will be called ``event.'' In this sense, an automaton propositional calculus, just as the quantum propositional calculus, is obtained {\it experimentally}. It consists of all potentially measurable {\it elements of the automaton reality} and their logical structure, with the implication as order relation. The elementary propositions can be conveniently constructed by a partitioning of automaton states generated from the input-output analysis of the automaton as follows: Let $w=s_{1} s_{2} \cdots s_{k}$ be a sequence of input symbols, $$ a_{i,w} = a_{i}\delta_{s_{1}}(a_{i})\delta_{s_{2}}(\delta_{s_1} (a_{i}))\cdots \delta_{s_k}(\cdots \delta_{s_1}(a_{i})\cdots ) \eqno(1) $$ and $$ z=o(a_{i,w})= o(a_{i})o(\delta_{s_{1}}(a_{i}))o(\delta_{s_{2}}(\delta_{s_1} (a_{i})))\cdots o(\delta_{s_k}(\cdots \delta_{s_1}(a_{i})\cdots )). \eqno(2) $$ Let $$ \alpha_z^w=\{ a_i \mid o(a_{i,w})=z\} \eqno(3) $$ be the set of initial states which, on some fixed input sequence $w$ yield some fixed output sequence $z=t_{0}t_{1} t_{2} \cdots t_{k}$. I.e., $\alpha_z^w$ is the equivalence class of propositions identifiable by input $w$ and output $z$. The elements $\{\alpha_z^w\}$ of the partition $$ v(w) = \bigcup_z \{ \alpha_z^w \} \eqno(4) $$ define the equivalence classes of propositions identifiable by input $w$ and output $z$. $$ V= \bigcup_w v(w)=\{ v(\emptyset ),v(s_1),\ldots ,v(s_k),v(s_1s_2),\ldots \} \eqno(5) $$ is the set of partitions. Let $p_i$ be propositions of the form ``{\tt the automaton is in state} $a_i$.'' The proposition $$ p_1\vee p_2 \eqno(6) $$ (interpretable as ``$p_1$ or $p_2$'') defines a proposition of the form ``{\tt the automaton is in state} $a_1$ {\tt or} {\tt in state} $a_2$'' (or the set theoretic union ``$p_1 \cup p_2$'') if and only if there exist input sequences $s_{j}\cdots s_{m}$ such that $p_1 \vee p_2$ is identified by the partition $v(s_{j}\cdots s_{m})$. The proposition $$ p_j\wedge p_m \eqno(7) $$ (interpretable as ``$p_j$ and $p_m$'') defines a proposition of the form ``$p_j$ {\tt and} $p_m$'' (or the set theoretic intersection ``$p_j\cap p_m$'') if and only if there exist input sequences $s_{j}\cdots s_{m}$ such that $p_1 \wedge p_2$ is identified by the partition $v(s_{j}\cdots s_{m}$). The complement $$ \neg p_1 \eqno(8) $$ (or $p_1'$) of a proposition $p_1$ (has the meaning of ``not $p_1$'' and) is defined if and only if $$\eqalign{ p_1\wedge \neg p_1 &= {\bf 0} \cr p_1\vee \neg p_1 &= {\bf 1}\cr} $$ (or, with the propositions $p_1$ and $\neg p_1=p_j$ expressed as sets, $p_1\cap p_j={\bf 0}=\emptyset$ and $p_1\cup p_j={\bf 1}=\{1,2,\ldots ,i\}$), and there exist input sequences $s_{j}\cdots s_{m}$ such that $\neg p_1$ is a proposition identified by the partition $v(s_j\cdots s_m)$. A {\it partial order relation} $p_j\preceq p_m$, or $$ p_j\rightarrow p_m \eqno(9) $$ (with the interpretation ``$p_j $ implies $p_m$,'' or with ``whenever $p_j$ is true it follows that $p_m$ is true, too'') is defined if and only if $p_j $ {\tt implies} $p_m$, and there exist input sequences $s_{j}\cdots s_{m}$ such that $p_j$ and $p_m$ are propositions identified by the partition $v(s_{j}\cdots s_{m})$. The partial order relation can be conveniently represented by drawing its Hasse diagram. This can be done by proceeding in two steps. First, the Boolean lattices of propositional structures based on all relevant state partitions $v(w)$ are constructed. Then, the union of all these Boolean subalgebras provides the complete partial order of the automaton propositional calculus. This can also be understood graph theoretically \l35,36\r. A corresponding {\it Mathematica} package by Ch. Strnadl \l37\r\ can be obtained from the author. \titleb{4.3}{Example} For an explicit model of a non-distributive and modular automaton propositional calculus consider the transition and output table (Fig.~5a) of a (3,3,2)-automaton. Its diagram is shown in Fig.~5b. \begtwofig 4cm 5cm {\figure{5a.}{Transition and output table of a (3,2,2)-automaton of the Mealy type.}} {\figure{5b.}{Diagram of a (3,2,2)-automaton of the Mealy type.}} \endtwofig Input of 1, 2, or 3 steers the automaton into the respective state. At the same time, the output of the automaton is 1 only if the guess is a ``hit,'' i.e., if the automaton was in that state. Otherwise the output is 0. After the measurement, the automaton is in a definite state, i.e., the state corresponding to the input symbol. If the guess has not been a ``hit,'' the information about the initial automaton state is lost. Therefore, the experimenter has to decide before carrying out the measurement which one of the following hypotheses should be tested (in short-hand notation, ``$\{ 1\}$'' stands for ``{\tt the automaton is in state} $1$'' {\it et cetera}): $ \{ 1 \}= \neg \{ 2,3 \}, \{ 2 \}= \neg \{ 1,3 \}, \{ 3 \}= \neg \{ 1,2 \} $. Measurement of either one of these three hypotheses (or their complement) makes any measurement of the other two hypotheses impossible. No input, i.e., the empty input string $\emptyset$, identifies all three internal automaton states. This corresponds to the trivial information that the automaton is in {\it some} internal state. Input of the symbol 1 (and all sequences of symbols starting with 1) distinguishes between the hypothesis $\{1\}$ (output ``1'') and the hypothesis $\{2,3\}$ (output ``0''). Input of the symbol 2 (and all sequences of symbols starting with 2) distinguishes between the hypothesis $\{2\}$ (output ``1'') and the hypothesis $\{1,3\}$ (output ``0''). Input of the symbol 3 (and all sequences of symbols starting with 3) distinguishes between the hypothesis $\{3\}$ (output ``1'') and the hypothesis $\{1,2\}$ (output ``0''). The propositional calculus is thus defined by the partitions $$\eqalignno{ v(\emptyset )&=\{\{1,2,3\}\}, &(10)\cr v(1 )&=\{ \{1\} , \{2,3\} \}, &(11)\cr v(2 )&=\{ \{2\} , \{1,3\} \}, &(12)\cr v(3 )&=\{ \{3\} , \{1,2\} \}. &(13)\cr} $$ It can be represented by the lattice structure of Fig.~6. This lattice is of the ``Chinese latern'' $MO3$ form. It is non-distributive, and it is a pasting of three Boolean algebras $2^2$. \begfigside 5cm 6cm \figure{6.}{Lattice $MO3$ of the intrinsic propositional calculus of a (3,2,2)-automaton of the Mealy type.} \endfigside \begfig 14cm \figure{7.}{The class ${\frak F}_4$ of non-isomorphic Hasse diagrams of the intrinsic propositional calculi of generic 4-state automata of the Mealy type.} \endfig The obtained intrinsic propositional calculus in many ways resembles the lattice obtained from photon polarization experiments or from other incompatible quantum measurements. Consider an experiment measuring photon polarization. Then, three propositions of the form ``{\tt the photon has polarization} $p_{\phi_1}$,'' ($i=1,2,3$), cannot be measured simultaneously for the angles $\phi_1 \neq \phi_2\neq \phi_3 (\rm{mod} \pi )$. An irreversible measurement of one direction of polarization would result in a state preparation, making impossible measurement of the other directions of polarization, and resulting in a propositional calculus of the ``Chinese latern'' form $MO3$. The propositional calculi ${\frak F}_i$ of all Mealy-type automata with $i$ internal states can be constructed by combinatorial arguments \l38\r. Fig.~7 shows ${\frak F}_4$, the set of Hasse diagrams of generic intrinsic propositional calculi of Mealy automata up to 4 states. \titleb{4.4}{The Inverse Problem} The previous paragraphs concentrated on the construction of a suitable propositional calculus from the input-output analysis of an automaton. The inverse problem is the construction of suitable automata which correspond to (orthomodular) lattices, in particular to subalgebras of Hilbert lattices. Stated differently: {\it ``given an arbitrary orthomodular (subalgebra of a Hilbert) lattice ${\frak L}$; is it possible to construct an automaton propositional calculus ${\frak A} $ realizing ${\frak L}$?''} If, as will be shown below, (for finite lattices) the question can be decided positively and constructively, then one obtains an explicit automaton model for every arbitrary quantum system (but not {\it vice versa}). Let an {\it orthomodular lattice} be a lattice satisfying the orthomodular law, and let a {\it Hilbert lattice} be the lattice of all closed subspaces of a Hilbert space, with the ``infimum'' operator defined by the intersection of subspaces, the ``supremum'' operator defined by the closure of the linear span of subspaces and the orthocomplement defined by the orthogonal subspace. Any finite (``finite'' means that the lattice has a finite number of elements) orthomodular lattice is isomorphic (1-1 translatable) to some finite (lattice) automaton propositional calculus. I.e., $$ {\rm finite\ orthomodular\ lattice}\ \eqalign{&\Rightarrow \cr &\nLeftarrow }\ \ {\rm finite\ automaton\ prop.\ calculus} \eqno (14) $$ Therefore, any finite orthomodular subalgebra of a Hilbert lattice is isomorphic (1-1 translatable) to some finite automaton propositional calculus. I.e., $$\left\{\eqalign{ &{\rm finite\ orthomodular\ subalgebra }\cr &{\rm of\ Hilbert\ lattice\ (quantum\ logic)}\cr} \right\} \ \eqalign{&\Rightarrow \cr &\nLeftarrow \cr}\ \ {\rm finite\ aut.\ prop.\ calculus} \eqno (15) $$ An actual proof of these statements is too technical and can be found elsewhere \l38\r. It makes use of the fact that every orthomodular lattice is a pasting of its maximal Boolean subalgebras, also called {\it blocks} \l26,39\r. These blocks can be elegantly represented by sets of partitions of automata states, because ``at face value,'' every automaton state partition $v(\dots )$ with $n$ elements generates a Boolean algebra $2^n$. If one identifies these Boolean algebras with blocks, the set of automaton state partitions $V$ represents a complete family of blocks of the automaton propositional calculus. \titleb{4.5}{Discussion} Strictly speaking, automaton models for quantum systems correspond to nonlocal hidden variable models. The ``hidden'' physical entities are the ``true'' initial states of automata. It is not entirely unreasonable to speculate about logico-algebraic structures of automaton universes in general. To put it pointedly, one could ask, {\it ``how would creatures embedded in a universal computer perceive their universe?''} The lattice-theoretic answer might be as follows. Let ${\frak F}_i$ stand for the family of all intrinsic propositional calculi of automata with $i$ states. From the point of view of logic, the intrinsic propositional calculi of a universe generated by universal computation is the limiting class $\lim_{n\rightarrow \infty }{\frak F}_n$ of all automata with $n \rightarrow \infty$ states. Since $ {\frak F}_1 \subset {\frak F}_2 \subset {\frak F}_3 \subset \dots \subset {\frak F}_i \subset {\frak F}_{i+1} \subset \dots $, this class ``starts with'' the propositional calculi represented by Fig.~7. %\ref{f-hdxxx}, p. %\pageref{f-hdxxx}. It is tempting to speculate that we live in a computer generated universe. But then, if the ``underlying'' computing agent were universal, {\it there is no {\it a priori} reason to exclude propositional calculi even if they do not correspond to an orthomodular subalgebra of a Hilbert lattice.} I.e., to test the speculation that we live in a universe created by universal computation, we would have to look for phenomena which correspond to automaton propositional calculi not contained in the subalgebras of some Hilbert space -- such as, for instance, the one represented by Fig.~8, %\ref{f:noa.pic2}, p. %\pageref{f:noa.pic2}, which is obtained from the state partition $ \{\{\{1\}, \{2\}, \{3, 4\}\}, \{\{1\}, \{2, 4\}, \{3\}\}, \{\{1, 2\}, \{3\}, \{4\}\}, \{\{1, 3\}, \{2\}, \{4\}\}\} $. \begfigside 5cm 6cm \figure{8.}{Hasse diagram of an algebraic structur which is neither a lattice nor a partial order.} \endfigside \begref{References}{39.} \refno{1.} O.E.~R\"ossler: Endophysics. In {\it Real Brains, Artificial Minds}, ed.~by J.L.~Casti and A.~Karlquist. North-Holland, New York 1987, pp.~25--46 \refno{2.} O.E.~R\"ossler: {\it Endophysik - Die Welt des inneren Beobachters.} Ed.~by P.~Weibel. Merwe Verlag, Berlin 1992 \refno{3.} O.E.~R\"ossler: Talk at the Endophysics Symposium, Linz, Austria, June 1992 \refno{4.} H.~Putnam: {\it Reason, Truth and History}. Cambridge University Press, Cambridge 1981 \refno{5.} K.R.~Popper: {\it British Journal for the Philosophy of Science} {\bf 1}, 117, 173 (1950) \refno{6.} E.F.~Moore: Gedanken-Experiments on Sequential Machines. In {\it Automata Studies}, ed.~by C.E.~Shannon and J.~McCarthy. Princeton University Press, Princeton 1956 \refno{7.} H.~Primas: Time-asymmetric phenomena in biology. {\it Open Systems \& Information Dynamics} {\bf 1}, 3--34 (1992) \refno{8.} K.~Svozil: On the setting of scales for space and time in arbitrary quantized media, {\it Lawrence Berkeley Laboratory preprint, LBL-16097}, May 1983. \refno{9.} K.~Svozil: {\it Il Nuovo Cimento} {\bf 96B}, 127 (1986) \refno{10.} K.~Svozil: {\it Europhysics Letters} {\bf 2}, 83 (1986) \refno{11.} K.~Svozil: {\it J. Phys.} {\bf A19}, L1125 (1986) \refno{12.} J.A.~Wheeler: Law without law. In {\it Quantum Theory and Measurement}, ed.~by J.A.~Wheeler and W.H.~Zurek. Princeton University Press, Princeton 1983, pp.~182--213 \refno{13.} A.~Einstein, B.~Podolsky and N.~Rosen: Can quantum-mechanical description of physical reality be considered complete? {\it Phys.~Rev.} {\bf 47}, 777--780 (1935) \refno{14.} A.~Peres and W.H.~Zurek: {\it Am.~J.~Phys.} {\bf 50}, 807 (1982) \refno{15.} A.~Peres: {\it Found.~Phys.} {\bf 15}, 201 (1985) \refno{16.} J.~Rothstein: {\it Int.~J.~Theor.~Phys.} {\bf 21}, 327 (1982) \refno{17.} S.~Ginsburg: {\it Journal of the Association for Computing Machinery} {\bf 5}, 266 (1958) \refno{18.} A.~Gill: {\it Information and Control} {\bf 4}, 132 (1961) \refno{19.} W.~Bauer: {\it Automatentheorie}. Teubner, Stuttgart 1984 \refno{20.} M.~Jammer: {\it The Philosophy of Quantum Mechanics}. Wiley, New York 1974 \refno{21.} J.A.~Wheeler and W.H.~Zurek (eds.): {\it Quantum Theory and Measurement}. Princeton University Press, Princeton 1983 \refno{22.} G.~Birkhoff: {\it Lattice Theory}. Publications of the American Mathematical Society, New York 1948 \refno{23.} G.~Birkhoff and J.~von Neumann: The logic of quantum mechanics, {\it Annals of Mathematics} {\bf 37}, 823--843 (1936) \refno{24.} J.M.~Jauch: {\it Foundations of Quantum Mechanics}. Addison-Wesley, Reading, Massachusetts, 1968 \refno{25.} C.~Piron: {\it Foundations of Quantum Physics}. W.A.~Benjamin, Reading, Massachusetts, 1976 \refno{26.} G.~Kalmbach: {\it Orthomodular Lattices}. Academic Press, New York 1983 \refno{27.} G.~Kalmbach: {\it Measures and Hilbert Lattices}. World Scientific, Singapore 1986 \refno{28.} P.~Pt\'ak and S.~Pulmannov\'a: {\it Orthomodular Structures as Quantum Logics}. Kluwer Academic Publishers, Dordrecht 1991 \refno{29.} R.~Giuntini: {\it Quantum Logic and Hidden Variables} (BI Wissenschaftsverlag, Mannheim 1991 \refno{30.} J.E.~Hopcroft and J.D.~Ullman: {\it Introduction to Automata Theory, Languages, and Computation}. Addison-Wesley, Reading, Massachusetts, 1979 \refno{31.} J.H.~Conway: {\it Regular Algebra and Finite Machines}. Chapman and Hall Ltd., London 1971 \refno{32.} D.~Finkelstein: Holistic methods in quantum logic. In {\it Quantum Theory and the Structures of Time and Space, Vol.~3}, ed.~by L.~Castell and C.F.~von Weizs\"acker. Carl Hanser Verlag, M\"unchen 1979, pp.~37--60 \refno{33.} D.~Finkelstein and S.R.~Finkelstein: Computational complementarity, {\it Int. J.~Theor.~Phys.} {\bf 22}, 753--779 (1983) \refno{34.} ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT:HAA@IBMA.IPP-GARCHING.MPG.DE> Received: from IBM.GWDG.DE (NJE origin MAILER@DGOGWDG1) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 4686; Wed, 19 May 1993 17:38:01 +0100 Received: from DGOGWDG1 by IBM.GWDG.DE (Mailer R2.08) with BSMTP id 7918; Wed, 19 May 93 17:31:57 MSZ Received: from nsat.ipp-garching.mpg.de by ibm.gwdg.de (IBM VM SMTP R1.2.2MX) with TCP; Wed, 19 May 93 17:31:55 MSZ Received: from ibma.ipp-garching.mpg.de by nsat.ipp-garching.mpg.de (AIX 3.2/UCB 5.64/4.03) id AA17412; Wed, 19 May 1993 17:31:58 +0200 Message-Id: <9305191531.AA17412@nsat.ipp-garching.mpg.de> Received: from DGAIPP1S.EARN by IBMA.ipp-garching.mpg.de (IBM VM SMTP V2R1) with BSMTP id 3215; Wed, 19 May 93 17:31:36 MSZ Received: by DGAIPP1S (Mailer R2.08) id 6461; Wed, 19 May 93 17:31:35 MSZ Date: Wed, 19 May 93 17:29:17 MSZ From: harald atmanspacher To: karl svozil Lieber Karl, hast Du Dein Manuskript noch mal durchgesehen? Bitte schicke mir eine Nachricht, sobald Du damit so weit fertig bist. Schoene Feiertage und alles Gute, Dein Harald. ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT,@CUNYVM.CUNY.EDU:pbb@HUOSHAN.LANL.GOV> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 9975; Tue, 18 May 1993 18:56:08 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 5375; Tue, 18 May 1993 12:55:46 -0400 Received: from p.lanl.gov by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Tue, 18 May 93 12:55:42 EDT Received: from goshawk.lanl.gov by p.lanl.gov (5.65/1.14) id AA28196; Tue, 18 May 93 09:14:44 -0600 Received: from huoshan. (huoshan.lanl.gov) by goshawk.lanl.gov (4.1/5.17) id AA12354; Tue, 18 May 93 09:14:42 MDT Received: by huoshan. (4.1/SMI-4.1) id AA24695; Tue, 18 May 93 09:07:24 MDT Date: Tue, 18 May 93 09:07:24 MDT From: pbb@huoshan.lanl.gov (Preprint Bulletin Board) Message-Id: <9305181507.AA24695@huoshan.> To: new_distribution@huoshan.LANL.GOV {*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*} {*}+ +{*} {*}+ NONLINEAR SCIENCE +{*} {*}+ PREPRINT BULLETIN BOARD (PBB) +{*} {*}+ +{*} {*}+ Coordinated by the +{*} {*}+ Center for Nonlinear Studies (CNLS) +{*} {*}+ Software developed by Theoretical Division +{*} {*}+ Los Alamos National Laboratory +{*} {*}+ +{*} {*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*} An electronic Preprint Bulletin Board (PBB) is now available for nonlinear science. The PBB began operation in March of 1993, and currently has over 850 subscribers in 41 countries and contains more than 90 preprints. The PBB provides a fully automated system for the archiving and distribution of electronic preprints. Preprints are submitted electronically to the system, which assigns them reference numbers, and makes them available to PBB users via a wide variety of conventional means of network access. The simplest such access is via e-mail request, through which remote users may, for example, get help on available commands, obtain the full texts of papers, obtain listings for given periods, and search for author names or keywords. The system allows the original submitter of a paper to incorporate ongoing corrections and addenda (and adds an entry to the daily listings with an author supplied synopsis of any changes). The system also permits anonymous FTP access to papers and macros stored in the data base, as well as access by other rapidly developing network utilities such as WAIS, Gopher, and WorldWideWeb. A cross-referencing feature is available to establish linkages among bulletin boards in different disciplines. All researchers in the nonlinear science community are invited to submit electronic preprints to the Nonlinear Science PBB. For purposes of standardization, authors are encouraged, albeit not required, to submit text in TeX or LaTeX format, with figures in uuencoded tar-compressed postscript files. PBB subscribers are notified regularly by e-mail of new submissions. Usage of the PBB is free of charge. The nonlinear science PBB is divided into the following categories: CATEGORY INTERNET ADDRESS ADVISORS dynamical systems/chaos/ chao-dyn@xyz.lanl.gov Predrag Cvitanovic quantum chaos/topological Mitchell Feigenbaum dynamics/cycle expansions/ John Guckenheimer turbulence/propagation Ronnie Mainieri Jerrold Marsden Michael Tabor pattern formation/coherent patt-sol@xyz.lanl.gov Alan Bishop structures/solitons David Campbell Sue Coppersmith Irving Epstein Alan Newell adaptation/interacting adap-org@xyz.lanl.gov Phil Anderson particle systems/self- James Crutchfield organizing systems/ David Griffeath computation theory/ Charles Taylor machine learning Jordan Pollack Daniel Stein computational methods/time comp-gas@xyz.lanl.gov Gregory Beylkin series analysis/signal Gary Doolen processing/wavelets/lattice James Glimm gases Brosl Hasslacher James M. Hyman George Zweig exactly solvable systems/ solv-int@xyz.lanl.gov Mark Ablowitz integrable PDEs/integrable Toni Degasperis ODEs/Painleve analysis/ Ludwig Faddeev integrable discrete maps/ Benno Fuchssteiner solvable lattice models/ Michio Jimbo integrable quantum systems Martin Kruskal [all of the above] nlin-sys@xyz.lanl.gov Erica Jen Information on usage of the PBB may be obtained by sending an e-mail message with the subject "help" and a blank message body to any of the above internet addresses; e.g.. To: nlin-sys@xyz.lanl.gov Subject: help Included in the "help" documentation are instructions for the use of other commands: subscribe get put listing cross replace cancel add find distribution published comment typically invoked, as in the case of "help," by sending e-mail to the proper internet address with a subject consisting of the command and requisite arguments, together with a message body where appropriate. To subscribe to the full nlin-sys, for example, send e-mail with a blank message body To: nlin-sys@xyz.lanl.gov Subject: subscribe [your name] replacing [your name] by your full name (spaces and initials allowed) as you wish it to appear in the distribution list. Preprint notifications will then be sent to the e-mail address from which you subscribed. Any of the categories [chao-dyn patt-sol adap-org comp-gas solv-int] may be substituted for nlin-sys if you wish to subscribe only to that subset. PBBs currently in operation in other disciplines, utilizing the same software and to which cross-linkages are operative, include: alg-geom@publications.math.duke.edu (algebraic geometry) astro-ph@babbage.sissa.it (astrophysics) cond-mat@babbage.sissa.it (condensed matter) e-mail@xxx.lanl.gov (e-mail address database) funct-an@babbage.sissa.it (functional analysis) gr-qc@xxx.lanl.gov (gravitation, quantum cosmology) nucl-th@xxx.lanl.gov (nuclear physics, theory) hep-lat@ftp.scri.fsu.edu (computational and lattice physics) hep-ph@xxx.lanl.gov (high energy physics, phenomenological) hep-th@xxx.lanl.gov (high energy physics, formal) {*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*}+{*} ======================================================================== 5 Date: Wed, 26 May 93 10:31:49 MEZ From: "Svozil Karl, Ph.D." To: HAA@IBMA.ipp-garching.mpg.de Lieber Harald: habe das TeX-file erhalten. Vielen Dank. Karl ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 2467; Thu, 27 May 1993 00:23:47 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 5519; Wed, 26 May 1993 18:23:23 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Wed, 26 May 93 18:23:18 EDT Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GYO0CHVULC95OZOE@aukuni.ac.nz>; Thu, 27 May 1993 10:23:20 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA12049; Thu, 27 May 93 10:22:12 +1200 Date: 27 May 1993 10:22:12 +1200 From: cristian@cs.aukuni.ac.nz (Cris Calude) To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9305262222.AA12049@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz Dear Karl, I have finished the book and I am sending it to you. Please put in the same directory the files: block.sty proofbook.sty the file of the book Any comments will be highly appreciated. Best regards, Cris Cristian Sorin Calude | Email: cristian@cs.aukuni.ac.nz Computer Science Department | cristian@cs.auckland.ac.nz University of Auckland | Phone: +64-9-373-7599 x 5751 Private Bag 92019, Auckland, New Zealand | Fax: +64-9-373-7453 ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 2474; Thu, 27 May 1993 00:26:33 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 5619; Wed, 26 May 1993 18:26:12 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Wed, 26 May 93 18:26:08 EDT Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GYO0E4S5M895P0IS@aukuni.ac.nz>; Thu, 27 May 1993 10:24:40 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA12060; Thu, 27 May 93 10:23:22 +1200 Date: 27 May 1993 10:23:22 +1200 From: cristian@cs.aukuni.ac.nz (Cris Calude) Subject: proofbook.sty To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9305262223.AA12060@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz X-Attachments: :Macintosh HD:2:proofbook.sty: Cristian Sorin Calude | Email: cristian@cs.aukuni.ac.nz Computer Science Department | cristian@cs.auckland.ac.nz University of Auckland | Phone: +64-9-373-7599 x 5751 Private Bag 92019, Auckland, New Zealand | Fax: +64-9-373-7453 \typeout{Cris' proof style. 6th April 1993} \def\@captionANDoparg{} % Optional argument is *in addition* to caption \input block.sty \def\endofproofmark{$\Box$} \newblock(\let\endofblockmark\endofproofmark){proof}{Proof} \newcounter{blockcounter}[chapter] % theorems etc numbered within chapters \def\theblockcounter{\thechapter.\arabic{blockcounter}} \newnrblock(\let\endofblock\relax){theo}[blockcounter]{Theorem} \newnrblock(\let\endofblock\relax){prop}[blockcounter]{Proposition} \newnrblock(\let\endofblock\relax){defin}[blockcounter]{Definition} \newnrblock(\let\endofblock\relax){fact}[blockcounter]{Fact} \newnrblock(\let\endofblock\relax){example}[blockcounter]{Example} \newnrblock(\let\endofblock\relax){lem}[blockcounter]{Lemma} \newnrblock(\let\endofblock\relax){cor}[blockcounter]{Corollary} \newnrblock(\let\endofblock\relax){claim}[blockcounter]{Claim} \newnrblock(\let\endofblock\relax){scholium}[blockcounter]{Scholium} \def\@blocksetup{% % 2nd parameter in \list{...}{...} ---- \endlist \leftmargin 0pt\rightmargin 0pt \labelwidth 0pt \itemindent0pt \labelsep 1em \def\makelabel##1{\hskip\labelsep##1\hfill}} % increased labelsep \def\@Theader#1{{\bf #1}.} \def\@TOheader#1#2{{\bf #1} (#2).} \def\@NTheader#1#2{{\bf #2 #1}.} \def\@NTOheader#1#2#3{{\bf #2 #1} (#3).} ========================================================================= Return-Path: <@AWIUNI11.EDVZ.UNIVIE.AC.AT, @CUNYVM.CUNY.EDU:cristian@CS.AUKUNI.AC.NZ> Received: from CUNYVM.CUNY.EDU (NJE origin MAILER@CUNYVMV2) by AWIUNI11.EDVZ.UNIVIE.AC.AT (LMail V1.1d/1.7f) with BSMTP id 2478; Thu, 27 May 1993 00:26:45 +0100 Received: from CUNYVM (NJE origin SMTP@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.1d/1.7f) with BSMTP id 5649; Wed, 26 May 1993 18:26:27 -0400 Received: from CCVCOM.AUKUNI.AC.NZ by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with TCP; Wed, 26 May 93 18:26:20 EDT Received: from cs18.cs.aukuni.ac.nz by aukuni.ac.nz (PMDF #2864 ) id <01GYO0EN9XLC95P0BR@aukuni.ac.nz>; Thu, 27 May 1993 10:25:19 +1200 Received: from cristian.cs.aukuni.ac.nz by cs18.cs.aukuni.ac.nz (5.64/4.7) id AA12053; Thu, 27 May 93 10:22:41 +1200 Date: 27 May 1993 10:22:41 +1200 From: cristian@cs.aukuni.ac.nz (Cris Calude) Subject: block.sty To: e1360dab <@cunyvm.cuny.edu:e1360dab@awiuni11.bitnet> Message-id: <9305262222.AA12053@cs18.cs.aukuni.ac.nz> Content-transfer-encoding: 7BIT X-Sender: cristian@cs18.cs.aukuni.ac.nz X-Attachments: :Macintosh HD:2:block.sty: Cristian Sorin Calude | Email: cristian@cs.aukuni.ac.nz Computer Science Department | cristian@cs.auckland.ac.nz University of Auckland | Phone: +64-9-373-7599 x 5751 Private Bag 92019, Auckland, New Zealand | Fax: +64-9-373-7453 % Changed \endnrblocks from \@anyblockend to \@anyblocksend % % Changed \slanted to \slantedblock % % Put an empty box after the start of each \block and \nrblock % % Commented out all the default block types % **************************************** % * BLOCK ENVIRONMENTS * % **************************************** % % A BLOCK is a piece of text with a caption and a clear end. % (LaTeX's \newtheorem creates block environments: here % the caption TEXT is specified at creation of the environment, % the block end is clear from the font used for the text of the block.) % We give a 'block'-environment and a 'nrblock'-environment (for % numbered blocks, like theorems), as well as '(nr)block'-environment % CREATING commands; (and even for plural blocks: 'nrblocks'-environments % that expect an item list as body, exactly like enumerate). % % The user creates his own numbered block environments with the commands % % \newnrblock{NAME}{TEXT}[COUNTER] % \newnrblock{NAME}[OLDNAME]{TEXT} % % These commands works "exactly" like LaTeX's \newtheorem , so % both [COUNTER] and [OLDNAME] are optional (see below). % You can also create blocks that are not numbered, with the command % % \newblock{NAME}{TEXT} % % You can also use the plural form: just say % % `newnrblocks' instead of `newnrblock', and % `newblocks' instead of `newblock', % % in which case the body of an environment NAME has to be an % \item list, just like in enumerate environments. % Actually, *ALL* these commands have an optional FIRST argument, % written within parentheses ( and ) , % that is an amendment to the default block set-up. % (The command \slantedblock is a predefined amendment, whose default % gives >>exactly<< the effect of LaTeX's \newtheorem.) % % Instead of creating an environment, % you can also use an in-place environment: % % \begin{block}{TEXT}[OPARG] ... \end{block} % \begin{nrblock}[OLDNAME]{TEXT}[OPARG] ... \end{nrblock} % % and the plural form: blocks/nrblocks instead of block/nrblock. % % Again, *ALL* these environments may have an optional FIRST argument, % written within parentheses ( and ) , that is % an amendment to the default block set-up. ( E.g., \slantedblock .) % % For those who do not know LaTeX's \newtheorem command: % If OLDNAME is given, then new environments (NAME or nrblock) and OLDNAME % use the same counter, so using a NAME or that nrblock environment % advances the number of OLDNAME, and vice-versa. % (OLDNAME may be just a counter.) % % If COUNTER is given, then environment NAME is numbered within COUNTER: % whenever COUNTER is advanced, the counter NAME is reset to zero, % and the way the number is printed reflects this. % (E.g., if COUNTER = subsection, % then the first NAME in subsection 7.2 is numbered 7.2.1.) % The way NAME environments are numbered can be changed by redefining % \theNAME. % % % DOCUMENT STYLE PARAMETERS % % \endofblock the command that ends the text of the block(s last item) % --default: \endofblockmark flush right on last line. % --alternative: `(End of \blockcaption)' on next line % --(see below; do this for nested blocks). % \endofblockmark may be used in (a renewal of) \endofblock (see above) % --default: $\Box$ . % \blockcaption may be used in (a renewal of) \endofblock % --default: is set to the caption of the CURRENT block. % \blockitemmark replacement for the number in blocks % --default: $\m@th\bullet$ % \@blocksetup detemines indentation and font and so on of any block % --default: \rm, no indentation % \@blockssetup detemines indentation and font and so on of any blocks % --default: \rm, no indentation % \slantedblock an amendment to \@blocksetup % --deault: \sl, \def\endofblockmark{} % \@captionANDoparg if defined in time (a few lines below), then % both caption TEXT and OPARG printed when both are present % otherwise TEXT is replaced by OPARG when present. % --default: see a few lines below. % Next come the commands that determine the way the caption text T, the % number N, and the optional argument O are printed. % Default: (N) preceding T and/or O, rather than N succeeding T as in LaTeX. % (N,T,O correspond to the parameters in order of appearence.) % % %\def\@captionANDoparg{} % or do this in a .sty file preceding this one. \@ifundefined{@captionANDoparg}{ % NOT both; so, optional argument overrules the default caption text \def\@Theader#1{\bf #1} \def\@TOheader#1#2{\bf #2} \def\@NTheader#1#2{\bf (#1)\ #2} \def\@NTOheader#1#2#3{\bf (#1)\ #3} \def\@Tlistheader#1{\bf #1} \def\@Titemheader#1{\blockitemmark} \def\@TOlistheader#1#2{\bf #2} \def\@TOitemheader#1#2{\blockitemmark} \def\@NTlistheader#1#2{\bf #2} % entire list: no number, only caption \def\@NTitemheader#1#2{\bf (#1)} % each item: number, but no caption \def\@NTOlistheader#1#2#3{\bf #3} \def\@NTOitemheader#1#2#3{\bf (#1)} }{ % optional argument as an addition to the caption text \def\@Theader#1{\bf #1} \def\@TOheader#1#2{\bf #1\ (#2)} \def\@NTheader#1#2{\bf (#1)\ #2} \def\@NTOheader#1#2#3{\bf (#1)\ #2 (#3)} \def\@Tlistheader#1{\bf #1} \def\@Titemheader#1{\blockitemmark} \def\@TOlistheader#1#2{\bf #1\ (#2)} \def\@TOitemheader#1#2{\blockitemmark} \def\@NTlistheader#1#2{\bf #2} % entire list: no number, only caption \def\@NTitemheader#1#2{\bf (#1)} % each item: number, but no caption \def\@NTOlistheader#1#2#3{\bf #2 (#3)} \def\@NTOitemheader#1#2#3{\bf (#1)} } % ................... the definitions proper ............................ % Any block(s) is implemented as a \list{...}{...} ----- \endlist . \def\@anyblockend{\endofblock\endlist} \def\@anyblocksend{\endofblock\endlist} \def\endofblock{% % according to the TeX book, at the end of Chapter 14: \unskip\nobreak\hfil\penalty50 \hskip1em\hbox{}\hfil\endofblockmark \parfillskip=0pt\finalhyphendemerits=0} % ALTERNATIVE DEFINITION: (on the next line, without page break) % {\ifvmode\vskip-\lastskip\else\\*\fi\rm (End of \blockcaption)} \def\endofblockmark{$\m@th\Box$} \def\blockcaption{} % is set inside blocks to the current caption. \def\@blocksetup{% % 2nd parameter in \list{...}{...} ---- \endlist \leftmargin 0pt\rightmargin 0pt \labelwidth 0pt \itemindent0pt \def\makelabel##1{\hskip\labelsep##1\hfill}} % ALTERNATIVE DEFINITION: just {\rm} to get indented blocks. \def\@blockssetup{\@blocksetup} % ALTERNATIVE DEFINITION: just {\rm} to get indented blocks-items. \newcommand\slantedblock{\sl\def\endofblockmark{}} % standard amendment to setup. \def\blockitemmark{$\m@th\bullet$} % ............... the beginning of a (nr)block(s) (item) ................ % In the following, % parameter (#1) is the amendment to the default \@blocksetup , and % C(ounter),N,T,O give the meaning of the remaining parameters (in order). \def\@Tblockbegin(#1)#2{% \list{}{\@blocksetup #1}\item[\@Theader{#2}]\mbox{}} \def\@TOblockbegin(#1)#2[#3]{% \list{}{\@blocksetup #1}\item[\@TOheader{#2}{#3}]\mbox{}} \def\@NTblockbegin(#1)#2#3{% \list{}{\@blocksetup #1}\item[\@NTheader{#2}{#3}]\mbox{}} \def\@NTOblockbegin(#1)#2#3[#4]{% \list{}{\@blocksetup #1}\item[\@NTOheader{#2}{#3}{#4}]\mbox{}} \def\@Tblocksbegin(#1)#2{% \list{\@Titemheader{#2}}{\@blockssetup #1} \item[\@Tlistheader{#2}]\mbox{} \vspace{-\itemsep}\vspace{-\parsep}} \def\@TOblocksbegin(#1)#2[#3]{% \list{\@TOitemheader{#2}{#3}}{\@blockssetup #1} \item[\@TOlistheader{#2}{#3}]\mbox{} \vspace{-\itemsep}\vspace{-\parsep}} \def\@CTblocksbegin(#1)[#2]#3{% \count255=\value{#2} % to nullify the setting to zero by \usecounter \list{\@NTitemheader{\csname the#2\endcsname}{#3}}% {\usecounter{#2} \setcounter{#2}{\count255} \@blockssetup #1} \item[\@NTlistheader{\csname the#2\endcsname}{#3}]\mbox{} \vspace{-\itemsep}\vspace{-\parsep}} \def\@CTOblocksbegin(#1)[#2]#3[#4]{% \count255=\value{#2} % to nullify the setting to zero by \usecounter \list{\@NTOitemheader{\csname the#2\endcsname}{#3}{#4}}% {\usecounter{#2} \setcounter{#2}{\count255} \@blockssetup #1} \item[\@NTOlistheader{\csname the#2\endcsname}{#3}{#4}]\mbox{} \vspace{-\itemsep}\vspace{-\parsep}} %..................... (nr)block(s) ENVIRONMENTS .......................... \newenvironment{block}% {\@ifnextchar({\@blockbegin}{\@blockbegin()}}{\@anyblockend} \def\@blockbegin(#1)#2{% \def\blockcaption{#2}% \@ifnextchar[{\@TOblockbegin(#1){#2}}{\@Tblockbegin(#1){#2}}} \newenvironment{blocks}% {\@ifnextchar({\@blocksbegin}{\@blocksbegin()}}{\@anyblocksend} \def\@blocksbegin(#1)#2{% \def\blockcaption{#2}% \@ifnextchar[{\@TOblocksbegin(#1){#2}}{\@Tblocksbegin(#1){#2}}} \newenvironment{nrblock}% {\@ifnextchar({\@nrblockbegin}{\@nrblockbegin()}}{\@anyblockend} \def\@nrblockbegin(#1)[#2]#3{% \def\blockcaption{#3} \refstepcounter{#2}% \@ifnextchar[{\@NTOblockbegin(#1){\csname the#2\endcsname}{#3}} {\@NTblockbegin(#1){\csname the#2\endcsname}{#3}}} \newenvironment{nrblocks}% {\@ifnextchar({\@nrblocksbegin}{\@nrblocksbegin()}}{\@anyblocksend} \def\@nrblocksbegin(#1)[#2]#3{% \def\blockcaption{#3} % NO \refstepcounter{#2} -- only at the items \@ifnextchar[{\@CTOblocksbegin(#1)[#2]{#3}}{\@CTblocksbegin(#1)[#2]{#3}}} % ...................... NEW (nr)block(s) commands ...................... \def\newblock{\@ifnextchar({\@newblock}{\@newblock()}} \def\@newblock(#1)#2#3{% \newenvironment{#2}{\@blockbegin(#1){#3}}{\@anyblockend}} \def\newblocks{\@ifnextchar({\@newblocks}{\@newblocks()}} \def\@newblocks(#1)#2#3{% \newenvironment{#2}{\@blocksbegin(#1){#3}}{\@anyblocksend}} \def\newnrblock{\@ifnextchar({\z@newnrblock}{\z@newnrblock()}} \def\z@newnrblock(#1)#2{% \@ifnextchar[{\@newnrblock(#1){#2}}{\@@newnrblock(#1){#2}}} \def\@@newnrblock(#1)#2#3{% \@ifnextchar[{\@x@newnrblock(#1){#2}{#3}}{\@y@newnrblock(#1){#2}{#3}}} \def\@x@newnrblock(#1)#2#3[#4]{% \newcounter{#2}[#4] \expandafter\def\csname the#2\endcsname{\csname the#4\endcsname.\arabic{#2}} \@newnrblock(#1){#2}[#2]{#3}} \def\@y@newnrblock(#1)#2#3{% \newcounter{#2} \@newnrblock(#1){#2}[#2]{#3}} \def\@newnrblock(#1)#2[#3]#4{% \newenvironment{#2}{\@nrblockbegin(#1)[#3]{#4}}{\@anyblockend}} \def\newnrblocks{\@ifnextchar({\z@newnrblocks}{\z@newnrblocks()}} \def\z@newnrblocks(#1)#2{% \@ifnextchar[{\@newnrblocks(#1){#2}}{\@@newnrblocks(#1){#2}}} \def\@@newnrblocks(#1)#2#3{% \@ifnextchar[{\@x@newnrblocks(#1){#2}{#3}}{\@y@newnrblocks(#1){#2}{#3}}} \def\@x@newnrblocks(#1)#2#3[#4]{% \newcounter{#2}[#4] \expandafter\def\csname the#2\endcsname{\csname the#4\endcsname.\arabic{#2}} \@newnrblocks(#1){#2}[#2]{#3}} \def\@y@newnrblocks(#1)#2#3{% \newcounter{#2} \@newnrblocks(#1){#2}[#2]{#3}} \def\@newnrblocks(#1)#2[#3]#4{% \newenvironment{#2}{\@nrblocksbegin(#1)[#3]{#4}}{\@anyblocksend}} % ======================= some applications ============================= % commented these out; better to let the user define her own %\def\mainctr{equation} %\newnrblock(\slantedblock){definition}[\mainctr]{Definition} %\newnrblock(\slantedblock){assumption}[\mainctr]{Assumption} %\newnrblock(\slantedblock){conjecture}[\mainctr]{Conjecture} %\newnrblock(\slantedblock){fact}[\mainctr]{Fact} %\newnrblock(\slantedblock){property}[\mainctr]{Property} %\newnrblock(\slantedblock){proposition}[\mainctr]{Proposition} %\newnrblock(\slantedblock){lemma}[\mainctr]{Lemma} %\newnrblock(\slantedblock){theorem}[\mainctr]{Theorem} %\newnrblock(\slantedblock){corollary}[\mainctr]{Corollary} %\newnrblock{example}[\mainctr]{Example} %\newnrblock{remark}[\mainctr]{Remark} %\newblock{proof}{Proof} %% .................. and the plural forms: %\newnrblocks(\slantedblock){definitions}[\mainctr]{Definitions} %\newnrblocks(\slantedblock){assumptions}[\mainctr]{Assumptions} %\newnrblocks(\slantedblock){conjectures}[\mainctr]{Conjectures} %\newnrblocks(\slantedblock){facts}[\mainctr]{Facts} %\newnrblocks(\slantedblock){properties}[\mainctr]{Properties} %\newnrblocks(\slantedblock){propositions}[\mainctr]{Propositions} %\newnrblocks(\slantedblock){lemmas}[\mainctr]{Lemmas} %\newnrblocks(\slantedblock){theorems}[\mainctr]{Theorems} %\newnrblocks(\slantedblock){corollaries}[\mainctr]{Corollaries} %\newnrblocks{examples}[\mainctr]{Examples} %\newnrblocks{remarks}[\mainctr]{Remarks} %\newblocks{proofs}{Proofs} ======================================================================== 14 Date: Thu, 27 May 93 13:04:05 MEZ From: "Svozil Karl, Ph.D." To: cristian@cs.aukuni.ac.nz Dear Cris: thank you very much for the e-mail. I have received two STYle files but no book (yet). After processing it, I shall read it carefully --- I have *much* more time now since I decided to send my book to the publisher this monday --- you will receive a hardcopy of it as soon as it l eaves the university copy shop (next monday, I presume). Thank you very much again for your help with my book. I am very much looking fo rward to read yours. Best greetings and wishes, Karl.