HDTenEightyP/NetNews huggingface dataset:
Newsgroups: comp.human-factors
From: ematias@dgp.toronto.edu (Edgar Matias)
Subject: Re: Keyboards for one-handed typing
Organization: CSRI, University of Toronto
Date: 24 Jul 92 18:40:30 GMT


>In our experiments, vertical
>representations were best, spatial arrangment second, and hand symmetry
>the worst.  What happens with the vertical representation when you flatten
>the panels, or when subjects are taught to imagine that their panels were
>tilted upright (but were in fact flat)?  Well, see experiments two and
>three for the exciting results.  The complete reference is Gopher, D.,

Yes, these results are very interesting indeed.  For those who don't
know, when Gopher et al. told their subjects to imagine that the flat
panels were vertical they got better results (when testing the hand
symmetry group).  This is very strange.  Especially strange is the fact
that the spatial congruence group beat the hand symmetry group.  I would
think it would be the other way around, as your subsequent experiment
with the imaginary group suggests.  I wonder, is it possible that you
may have failed to explain properly to your subjects what exactly is
meant by "hand symmetry"?  Maybe they just didn't 'get it'.

Also, studies of errors on QWERTY keyboards show a MUCH greater
frequency of substitution errors associated with hand symmetry 
(called "homologous errors") than with spatial congruence.  This suggests
that hand symmetry would be a better mapping scheme than spatial
congruence.  Note that homologous errors also appeared your spatial
congruence group, while there was no mention in your paper of spatial
congruence errors having occurred in the hand symmetry group.

DISCLAIMER: I'm currently doing an experiment very much related to this
hand symmetry vs. spatial congruence controversy (if you can call it that),
and as you can probably tell, I'm on the hand symmetry side while 
the Gopher paper tends to favour spatial congruence.

However, the your experiment did show that the vertical representation
keyboard beat both spatial congruence and hand symmetry representations.
It could be argued that the vertical keyboard was just a hand symmetry
keyboard with the panels tilted vertically ?-).

Edgar
Newsgroups: comp.human-factors
From: ematias@dgp.toronto.edu (Edgar Matias)
Subject: Re: E-mail addresses and HCI
Keywords: DNS, X400, X500
Organization: CSRI, University of Toronto
Date: 29 Jul 92 02:08:49 GMT


>There is a lot of discussion
>about the future of the Internet going on right now, and one
>of the possible changes is from domain naming to X.400.

I think only an idiot would choose the X.400 format over the Internet
*@* form, and I think that it's quite disturbing that they are
considering replacing something good with something bad.

Next they'll suggest we all start remembering our phone numbers
in binary...

Edgar "Who do you think you are?  The man from Del Monte?" Matias
From: hammouch@ergo.inria.fr (Hamid Hammouche)
Newsgroups: comp.human-factors
Subject: BA/HF Network
Keywords: Behavior Analysis, Human Factors
Date: 29 Jul 92 12:59:58 GMT
Organization: INRIA * Rocquencourt BP 105 * F-78153 LE CHESNAY CEDEX* France


In august 1990, an announcement appeared in the "Human Factors Society Bulletin" (vol. 33, number 8) about a Behavior Analysis/Human Factors Network. This network was introduced at a special session of the 1990 Annual Meeting of the Human Factors Society.

As indicated in the bulletin, this network was established under the auspices of the Cambridge Center for Behavioral Studies with H.M. (Mac) Parsons as program manager. Charles O. Hopkins, Jefferson M. Koonce, Peter M. Mitchell, John A. Molino, and others were supposed to be present with H.M. (Mac) Parsons to describe the purposes and benefits of the network and its free newsletter.


I would greatelly apreciate receiving information on the network and its newsletter.

Thank you in advance. 

Please send your messages to:

J.M. Christian BASTIEN (bast@archie.inria.fr)
Institut National de Recherche en Informatique et Automatique
Projet Psychologie Ergonomique
Bat. 18
Rocquencourt, BP 105
LE CHESNAY CEDEX
France
From: zep@spider.aml.arizona.edu (Venkatesh Iyer)
Newsgroups: comp.theory
Subject: Help Wanted on Packing Problem
Date: 22 Jul 92 23:15:32 GMT
Article-I.D.: arizona.1992Jul22.161534.3527
Distribution: world,local
Organization: University of Arizona, Tucson, AZ

I am a Grad Student in Mech Engr. at the U of AZ.

I'd like help on the following problem:

I have N (about 200) rectangles (length Ai, width Bi).

I have n "pages" (L x H each) on which I must place these.

I want "n" to be as small as possible.

Variables: Ai, Bi, n

Constants: N, L, H

* Spaces left over on various pages don't matter, and neither
         does orientation of the rectangles (Bi x Ai is fine).
* AiBi < LH for all i.
*******

Any and all help is sincerely appreciated. Please reply by e-mail:

         zep@spider.ame.arizona.edu
                    or
           IYER@CCIT.Arizona.edu
From: bevan@cs.man.ac.uk (Stephen J Bevan)
Newsgroups: comp.theory
Subject: two level grammars / Chomsky type 0 grammars / Sin(t)?zoff proof
Date: 24 Jul 92 19:04:40 GMT
Organization: Department of Computer Science, University of Manchester

Does anybody have a full reference of the proof by M. Sin(t)?zoff that
for every Chomsky type 0 grammar there is a corresponding two level
grammar?  I noted down the citation from a Ph.D thesis I had on an
inter-library loan and then handed it back without checking the full
reference in the back :-<

The only extra information I have is that the citation was to
something in 1967.

ta

bevan
From: spexl@thor.cf.ac.uk (Mr X Liu 92)
Newsgroups: comp.theory.self-org-sys
Subject: paper on neural-nets and system modelling
Date: 21 Jul 92 09:24:49 GMT
Organization: University of Wales College of Cardiff, Cardiff, Wales, UK
X-Mailer: Cardiff Computing Maths PP Mail Open News Gateway


         Dynamic System Modelling Using Partially Recurrent
                     Neural Networks 

            (J. of Systems Engineering, 2:2, 90-97, 1992)

                  D.T. Pham and X. Liu 

        This paper presents the results of applying partially recurrent
        neural networks for linear dynamic systems modelling. The nets 
        adopted for the modelling were Elman nets. It was found that in
        their basic form such nets were only capable of modelling first
        -order systems. A modification was made to the net structure 
        enabling systems of higher orders to be modelled. Satisfactory 
        results were obtained for systems of up to the third order. The
        paper also discusses the differences between the tapped-delay-
        line method and recurrent net method for dynamic systems
        modelling.

Correspondence and offprint requests to: 
        
        D.T. Pham
        e-mail: phamdt@uk.ac.cardiff
        X. Liu
        e-mail: liux@uk.ac.cardiff.taff

        Intelligent Systems Research Laboratory, School of 
        Electrical, Electronic and Systems Engineering,
        University of Wales College of Cardiff
        P.O. Box 904, Cardiff CF1 3YH, U.K.
Newsgroups: comp.theory
From: sas@sbcs.sunysb.edu (Scott Smolka)
Subject: CONCUR '92 --- Deadlines for special conf. hotel rates are near!
Organization: State University of New York at Stony Brook
Date: Wed, 29 Jul 1992 20:58:33 GMT

			       CONCUR '92

	    Third International Conference on Concurrency Theory
		      Stony Brook, New York, USA
			   August 24-27, 1992


So far, approximately 100 people have registered for CONCUR '92, yet so far
only approximately 60 of them have made their hotel room reservation.  This is
to remind those of you in the group of 40 that starting Monday, Danfords will
accept room reservations at the special conference rate on a SPACE-AVAILABLE
basis only.  The same is true of the Holiday Inn Express starting August 6.

Room reservations can be made by phone or fax at the following numbers:

       Danfords			 Holiday Inn Express

Phone: +1 516 928-5200		Phone: +1 516 471-8000
Fax:  +1 516 928-3598		Fax: +1 516 471-8623

Further details about registration and accommodations, as well as the final
program, can be found in the Call for Registration, available in LaTex format
via anonymous ftp from sbcs.sunysb.edu (130.245.1.15).  The file is located in
pub/CONCUR92/cfr.tex.Z and is in compressed format.
From: marluova@sara.cc.utu.fi
Newsgroups: comp.theory
Subject: PR-QUADTREE question
Date: 20 Jul 92 11:05:19 GMT
Organization: University of Turku, Finland

Does anyone know where (book, magazine...) could I find 
information about PR-QUADTREE -data structure. I need 
basic algorithms (add, delete) for it. 

I searched several data structure books and didn't find
anything. If you have these algorithms please E-mail them 
to me.


Markku Luova
Computer Science
University of Turku
Finland

Email adress: marluova@kontu.utu.fi
From: jq@minster.york.ac.uk
Newsgroups: comp.theory
Subject: Category Theory for Computer Scientists
Date: 22 Jul 92 09:19:21 GMT
Organization: Department of Computer Science, University of York, England

As is the way, when this was discussed here a few months ago I had no need for
it, but now I do.  ;wq
From: lord+@andrew.cmu.edu (Tom Lord)
Newsgroups: comp.theory
Subject: regular expression benchmarks?
Date: 28 Jul 92 06:33:01 GMT
Article-I.D.: andrew.ceRJeRe00WB4EbvGwN
Organization: Carnegie Mellon, Pittsburgh, PA



Has there arisen a standard benchmark for the kind of regular expression
matcher you'd find in a text editor?
Xref: sparky comp.theory:1702 sci.math:9604
From: msh9848@hertz.njit.edu (Matt)
Newsgroups: comp.theory,sci.math
Subject: Pictorial representation of an arbitrary digraph
Date: 28 Jul 92 20:28:37 GMT
Organization: New Jersey Institute of Technology, Newark, N.J.


Hello, 

	I am looking for references in regards to drawing an arbitrary
DAG. I am attempting to write a graphics package which includes this feature. 
Is there anyone out there with any ideas? 

Matt
Newsgroups: comp.theory
From: femibyte@athena.mit.edu (Olufemi G Anthony)
Subject: Finite automaton
Organization: Massachusetts Institute of Technology
Distribution: usa
Date: Thu, 23 Jul 1992 21:26:35 GMT

Can someone supply me a DFA (deterministic finite automaton) that accepts
the following language over the alphabet {0,1}? : 

{all strings such that every block of five consecutive symbols contains
at least two 0's}


Just specifying the transition fucntion will be fine. Thanx.

Olufemi G. Anthony.
From: GautierA@vm1.ulaval.ca (Antoine Gautier)
Newsgroups: comp.theory
Subject: Re: Complexity of Integer Programming.
Date: 28 Jul 92 17:52:08 GMT
Reply-To: GautierA@vm1.ulaval.ca (Antoine Gautier)
Organization: Universite Laval

In article <1371@eagle.ukc.ac.uk> jkp@ukc.ac.uk (J.K.Pearson) writes:
>  
>  Can some body answear me a simple question, what is the complexity  
of integer
>  programming, (I think it's NP complete but I'm not sure.)

Yes it is! in its general form, IP includes TSP (traveling salesman)  
as well as many other NP Complete subcases. 

refer to
Garey and Johnson:
Computers and intractability: a Guide to NP Completeness.

or
Quayle, d.  "P = NP; the case P = 1..." (White house press).

-- NewsGrazer, a NeXTstep(tm) news reader, posting --
M>UQR=&8P7&%N<VE[7&9O;G1T8FQ<9C!<9FUO9&5R;B!#;W5R:65R.WT*7&UA
M<F=L,3(P"EQM87)G<C$R,`I<<&%R9%QT>#DV,%QT>#$Y,C!<='@R.#@P7'1X
M,S@T,%QT>#0X,#!<='@U-S8P7'1X-C<R,%QT>#<V.#!<='@X-C0P7'1X.38P
M,%QF,%QB7&DP7'5L,%QF<S,R($EN(&%R=&EC;&4@/#$S-S%`96%G;&4N=6MC
M+F%C+G5K/B!J:W!`=6MC+F%C+G5K("A*+DLN4&5A<G-O;BD@=W)I=&5S.EP*
M/B`@7`H^("!#86X@<V]M92!B;V1Y(&%N<W=E87(@;64@82!S:6UP;&4@<75E
M<W1I;VXL('=H870@:7,@=&AE(&-O;7!L97AI='D@;V8@:6YT96=E<EP*/B`@
M<')O9W)A;6UI;F<L("A)('1H:6YK(&ET)W,@3E`@8V]M<&QE=&4@8G5T($DG
M;2!N;W0@<W5R92XI7`I<"EEE<R!I="!I<R$@:6X@:71S(&=E;F5R86P@9F]R
M;2P@25`@:6YC;'5D97,@5%-0("AT<F%V96QI;F<@<V%L97-M86XI(&%S('=E
M;&P@87,@;6%N>2!O=&AE<B!.4"!#;VUP;&5T92!S=6)C87-E<RX@7`I<"G)E
M9F5R('1O7`I'87)E>2!A;F0@2F]H;G-O;CI<"D-O;7!U=&5R<R!A;F0@:6YT
M<F%C=&%B:6QI='DZ(&$@1W5I9&4@=&\@3E`@0V]M<&QE=&5N97-S+EP*7`IO
M<EP*475A>6QE+"!D+B`@(E`@/2!.4#L@=&AE(&-A<V4@4"`](#$N+BXB("A7
5:&ET92!H;W5S92!P<F5S<RDN"GT*
`
From: theory-net@FLASH.USC.EDU (Doug Ierardi)
Newsgroups: comp.theory
Subject: real number computability
Date: 23 Jul 92 03:22:45 GMT
Reply-To: Doug Ierardi <theory-net@FLASH.USC.EDU>


        I am working on computability on the domain of real numbers, and I would
    like to contact people interested in exchanging and discussing ideas.

        (How do I subscribe THEORYNT list?)

        Martin Hotzel Escardo
        Departamento de Informatica Teorica
        Universidade Federal do Rio Grande do Sul (UFRGS)
        Porto Alegre - RS - Brasil
        Email: Martin@INF.UFRGS.BR
From: rachel@natania.cs.ucla.edu (Rachel Ben-Eliyahu)
Newsgroups: comp.theory
Subject: tractable subsets for vertex cover
Date: 31 Jul 92 20:49:18 GMT
Distribution: usa
Organization: UCLA Computer Science Department
Originator: rachel@natania.cs.ucla.edu

Hi folks,

while working on a different subject, I have found a linear time 
algorithm for finding a minimal vertex cover of a k-tree. The algorithm
is quite simple and it is hard for me to believe that it was not found
before. Can anybody give me a reference please?

Thanks,
Rachel
Newsgroups: comp.theory
From: baumer@cs.utwente.nl (Han Baumer)
Subject: Re: Category Theory for Computer Scientists
Organization: University of Twente, Dept. of Computer Science
Date: Wed, 29 Jul 1992 08:53:08 GMT

R.F.C. Walters
Categories and Computer Science
Undergraduate Lecture Notes in Mathematics 2
Carslaw Publications
42 Boundary Road, Wahroonga,
Sydney, N.S.W. 2076
Australia

This is *really* intended for computing scientists.

-- 
     ___            Han Baumer                        <baumer@cs.utwente.nl>
 ___/   \________
|   \___/        | Univ. of Twente,  Dept. Computer Science,     TIOS-group
| ___ _   _   __ | P.O. Box 217,     NL-7500 AE  Enschede,  The Netherlands
|  |  |  / \ (_  |                   tel: +31 53 89 3742
|  |  |  \_/ __) |                   tel: +31 53 89 3755 fax: +31 53 333815
|________________|
From: bob@almeria.inria.fr (Renaud Marlet)
Newsgroups: comp.theory
Subject: Recent survey on decidability results for equational theories & TRS
Date: 21 Jul 92 13:44:16 GMT
Organization: INRIA, Sophia-Antipolis (Fr)


Could somebody suggest a reference to a recent survey on decidability
results for equational theories and TRS. Thanks.

-- Renaud  [bob@sophia.inria.fr]


-----------------------------------------------------------------------------
PS: just in case somebody knows... Given the axioms for /\,\/,T,F such that:

Associativity	(x /\ y) /\ z = x /\ (y /\ z)
		(x \/ y) \/ z = x \/ (y \/ z)
Distributivity	x /\ (y \/ z) = (x /\ y) \/ (x /\ z)
		x \/ (y /\ z) = (x \/ y) /\ (x \/ z)
Left identity	T /\ x = x
		F \/ x = x
Left zero	F /\ x = F
		T \/ x = T

Plus a bunch of ground axioms on other function symbols. For example:

		f(g(a,b),c) \/ k(l) = h(d) /\ (e \/ i(j))

What good (confluent, noetherian) a TRS may be found for these axioms?  Same
question with the addition of the commutativity of /\ and \/. Many thanks.
-----------------------------------------------------------------------------
From: langston@langston.cs.utk.edu (Mike Langston)
Newsgroups: comp.theory
Subject: Re: Finite automaton
Date: 23 Jul 92 22:33:00 GMT
Organization: Department of Computer Science, University of Tennessee
Distribution: usa
Reply-To: langston@langston.cs.utk.edu (Mike Langston)
NNTP-Posting-Host: langston.cs.utk.edu

are we again using usenet to try to get someone else 
to solve our homework problems?

olufemi g. anthony <femibyte@athena.mit.edu> asks:

> Can someone supply me a DFA (deterministic finite automaton) that accepts
> the following language over the alphabet {0,1}? : 
> {all strings such that every block of five consecutive symbols contains
> at least two 0's}

this is of course problem 2.5c from hopcroft-ullman

naughty naughty

-- mike
Newsgroups: comp.theory
From: alopez-o@neumann.waterloo.edu (Alex Lopez-Ortiz)
Subject: Re: Lower bound independence
Keywords: NP, independence
Organization: University of Waterloo
Date: Fri, 24 Jul 1992 18:28:55 GMT

In article <1992Jul24.155959.26446@cs.rochester.edu>, fulk@cs.rochester.edu (Mark Fulk) writes:
> In article <1992Jul23.204321.4615@math.waterloo.edu> alopez-o@neumann.waterloo.edu (Alex Lopez-Ortiz) writes:
> >I recall reading about a proof that there exists a problem of complexity 
> >n^2 for which only an exponential lower bound could ever be proven 
> >within some formal system. Iread the note in a survey.
> 
> You clearly have this wrong, since an n^2 problem could not have an
> exponential lower bound.

Yes, it is a typo, I meant to write upper bound.

>  I suspect that you are referring to work
> of Case and Royer, which shows the existence, for any reasonable formal
> system F, of a problem that is in linear time, provable in F to be in
> quadratic time (a clocked TM is supplied), but not provable in F to be
> in linear time.  The proof is a fairly straightforward diagonalization.
> For details and references, you might email royer@top.cis.syr.edu
> 
> Mark
> -- 
> Mark A. Fulk			University of Rochester
> Computer Science Department	fulk@cs.rochester.edu

-- 
Alex Lopez-Ortiz                              alopez-o@maytag.UWaterloo.ca
Deparment of Computer Science                       University of Waterloo
Waterloo, Ontario                                                   Canada
From: jr@cs.utexas.edu (Josyula Ramachandra Rao)
Newsgroups: comp.theory
Subject: Rommate for PODC
Date: 29 Jul 1992 15:37:57 -0500
Organization: CS Dept, University of Texas at Austin
Distribution: inet
NNTP-Posting-Host: lovelady.cs.utexas.edu

I am looking for a person to share a room at the Coast Plaza in Stanley
Park during ACM PODC 1992. I plan on booking a room from August 8th to 12th.
If interested, send me e-mail or call.

Thanks,

-J R Rao

e-mail: jr@cs.utexas.edu
home  : (512) 469-0860
office: (512) 471-9765

Newsgroups: comp.theory
From: minch@lotka.stanford.edu (Eric Minch)
Subject: Re: Category Theory for Computer Scientists
Organization: Stanford University, California, USA
Date: Thu, 23 Jul 1992 16:54:56 GMT

In article <711796759.14151@minster.york.ac.uk> jq@minster.york.ac.uk  
writes:
> As is the way, when this was discussed here a few months ago I had no  
need for
> it, but now I do.  ;wq

Are you looking for D.E. Rydeheard and R.M. Burstall's (1988)  
Computational Category Theory (Prentice-Hall)?
--
 
Eric Minch             Any resemblance to the opinions of persons
Epistemic Artisan      or organizations other than myself--living,
Stanford Genetics      dead, or imaginary--is purely fortuitous.
Newsgroups: comp.theory
Subject: Survey on P = NP?
From: jones@greg.cs.usu.edu (Gregory Jones)
Date: 21 Jul 92 08:48:28 MDT
Reply-To: jones@greg.cs.usu.edu (Gregory Jones)
Distribution: world
Organization: Utah State University

Does anybody know of a good, up-to-date survey of results on the relationship
of P and NP?

Lacking that, is there a good bibliography on the subject?

Thanks for the help.

Greg Jones			            (801)750-3267
Associate Department Head	    jones@greg.cs.usu.edu
Department of Computer Science
Utah State University, Logan  UT  84322-4205
From: wand@ccs.northeastern.edu (Mitchell Wand)
Newsgroups: comp.theory
Subject: Re: Category Theory for Computer Scientists
Summary: Pierce's book is MIT Press, not Computing Surveys
Date: 29 Jul 92 00:01:28 GMT
Organization: College of Computer Science, Northeastern University


Ben Pierce's book, "A Taste of Category Theory for Computer Scientists", which
was shown as "to appear in Computing Surveys", has in fact appeared as a book,
-- 
Mitchell Wand
College of Computer Science, Northeastern University
360 Huntington Avenue #161CN, Boston, MA 02115     Phone: (617) 437 2072
Internet: wand@flora.ccs.northeastern.edu          Fax:   (617) 437 5121
From: craig@grad04.math.ncsu.edu (Ralph Craig)
Subject: xlife: help
Organization: NCSU Mathematics Dept.
Distribution: comp.theory.cell-automata
Date: Tue, 28 Jul 1992 04:45:56 GMT

	I just ftp-ed a copy of xlife from mit but I am a
completely clueless user.  Won't someone please take pity
on a computer-illiterate and tell me s-l-o-w-l-y how to
get this thing up and running?
	BTW, I've already undecoded and untared it and I 
am very proud of that accomplishment.  Start from there.

Ralph Craig
craig@math.ncsu.edu
From: sut@dsbc.icl.co.uk (Secure Unix Team KID01)
Newsgroups: comp.theory.cell-automata
Subject: Re: Cellular Neural Net Implementation.
Date: 31 Jul 92 10:25:19 GMT
Distribution: comp.theory.cell-automata
Organization: ICL Bracknell, UK

In article <RPATIL.92Jul30150508@pylos.nmsu.edu> rpatil@nmsu.edu (Raj Patil) writes:
>
>Dose anyone have a cellular neural net implementation?
>

I would like to be in on this as well, please.

-- 
 =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
 | Martyn Amos -- Secure UNIX Team, ICL Kidsgrove, Staffs., ST7 1TL    O/  |
 | mra@skoda.zen.icl.co.uk -- Tel. (0782) 771000 Ext. 3152            /|   |
 | >>>>>>>>>>>>>> T E R M I N A L L Y   G R O O V Y <<<<<<<<<<<<<<<   / >  |
 |            Disclaimer: My mental state is not ICL's fault.              |
Xref: sparky comp.theory.cell-automata:317 comp.windows.news:431 comp.sys.sun.apps:1478
From: rhb@hotsand.cnet.att.com (Richard H. Brandwein +1 908 949 2135)
Subject: Re: HyperLook Cellular Automata Machine for OpenWindows V3 available for ftp
Reply-To: rich.brandwein@att.com
Organization: AT&T Bell Labs - Holmdel, NJ
Date: Fri, 31 Jul 1992 19:34:36 GMT
Originator: rhb@hotsand


In article <HOPKINS.92Jul26075612@delta9.turing.ac.uk>, hopkins@turing.ac.uk (Don Hopkins) writes:
|> 
|> The Cellular Automata Machine simulator (a SPARC binary with a bunch
|> of PostScript and data files) and the HyperLook runtime system are now
|> available for anonymous ftp!  HyperLook and the CAM simulator run
|> under OpenWindows Version 3 on color SPARC workstations.  They're
|> available for anonymous ftp from turing.com, in the file
|> "pub/CAM.tar.Z", or ftp.uu.net, in the file "packages/NeWS/CAM.tar.Z".

Every time I try to retrieve files on ftp.uu.net, I consistently get the 
following message:

	Entering Passive Mode 
	No primary connection

I am unable to download at this point.  I've tried turing.com, but
there is any incredibly slow (approx 300 b/s) transfer rate to there
from here.  What is my problem with ftp.uu.net?

-- 
--
	Rich Brandwein		rich.brandwein@att.com
Newsgroups: comp.theory.cell-automata
From: wieslaw@platinum.iss.nus.sg (wieslaw nowinski)
Subject: Info about PARCELLA needed
Originator: wieslaw@platinum
Organization: Institute of Systems Science, NUS, Singapore
Date: Wed, 29 Jul 1992 03:31:55 GMT

I am looking for program/date/e-mail of PARCELLA (International Workshop
on Parallel Processing by Cellular Automata & Arrays) usually held in
September in Berlin.
Thanks in advance for any pointers.

Wieslaw L Nowinski
National University of Singapore

Newsgroups: comp.theory.cell-automata