HDTenEightyP/NetNews huggingface dataset:
From: jones@ils.nwu.edu
Subject: New Ph.D. Program
Organization: institute for the learning sciences
Date: Mon, 9 Nov 1992 20:16:43 GMT

T h e   L  E  A  R  N  I  N  G    S  C  I  E  N  C  E  S    P h. D.   P r o g r
a m


Preparing individuals for productive work and a   high quality of life in
today's society is a complex  challenge for schools and corporations. To meet
this challenge, Northwestern University has established a unique Ph.D. program
in the Learning Sciences. Its purpose is to advance the research and
development of innovative educational structures and technologies.

Research in the Learning Sciences is aimed at creating environments that offer
all students a rich variety of opportunities for learning to think effectively,
both within and outside of formal learning settings. Graduate student and
faculty research efforts are supported by a multimedia, networked computing 
infrastructure and an unusual commitment to developing technologies that
function effectively within their intended settings. 

The Learning Sciences is a synthesis of computational and social science
disciplines including artificial intelligence, cognitive and developmental
psychology, educational research, linguistics, computer science, anthropology
and fields that develop strategies for teaching complex subject matter. 

Through research, field work and apprenticeships, the Ph.D. program will
prepare its graduates to assume leadership roles in advancing the scientific
understanding and systematic practices of learning and teaching.

Students are eligible for competitively-awarded multi-year funding. To qualify
for financial aid, candidates should apply by January 15, 1992. Applications
received after that date may be  considered. Individuals with relevant teaching
experience or a strong academic  background in a field related to the Learning
Sciences are encouraged to apply. For  application materials or for further
information, contact:

Professor Roy Pea
Ph.D. Program Chair 
The Learning Sciences 
Northwestern University
1890 Maple Avenue
Evanston, IL  60201
phone: 708-491-8152
fax:    708-491-5258
email: jones@ils.nwu.edu
 
Newsgroups: comp.theory
From: flow@gayakum.kaist.ac.kr (Paek In-Hyeok)
Subject: Wanted again: random generation of simple polygon
Organization: TC lab. CS Dept. KAIST
Date: Wed, 11 Nov 92 02:10:18 GMT


Thanx Alex and all.

What I'm trying to do is generating random simple polygon with n-vertices.
Normal distribution is ok but it's not important for me.
In fact, any distribution is ok.
Any material is ok.

					Thanks in advances,
					Paek InHyeok

e-mail: flow@gayakum.kaist.ac.kr or flow@jupiter.kaist.ac.kr

Newsgroups: comp.theory
From: royer@top.cis.syr.edu (Jim Royer)
Subject: LAST Reminder: STRUCTURES submissions are due Nov. 10
Organization: Syracuse University, CIS Dept.
Date: Thu, 5 Nov 92 14:11:54 EST

Submissions for the 1993 STRUCTURE IN COMPLEXITY THEORY CONFERENCE 
are due **November 10**.  For the full call for papers, send email to 

	structures@top.cis.syr.edu 

or contact the publicity chair, Jim Royer royer@top.cis.syr.edu.


Newsgroups: comp.theory
From: jordans@quip.eecs.umich.edu (Jordan Stojanovski)
Subject: Re: Is the following problem in NP?
Keywords: NP, polynomials, equations, solvability
Organization: University of Michigan EECS Dept., Ann Arbor
Date: Tue, 10 Nov 1992 09:28:35 GMT

In article <1992Nov10.084511.27971@CSD-NewsHost.Stanford.EDU> kolount@cauchy.stanford.edu (Mihail N Kolountzakis) writes:
>
>INPUT: a polynomial F(x_1, ... , x_N) of bounded degree (say 10)
>and integer coefficients (also bounded by say 100).
>
>OUTPUT: YES iff there are _real_ numbers x_1, ... , x_N that satisfy F=0.
>
>Please reply to "kolount@cauchy.stanford.edu".
>
>Mike Kolountzakis
>
>
>
>

Yes: Since there is a finite number of polynomials of bounded degree with
bounded integer coefficients, the solution is a table lookup, and your
problem can be solved by a finite automaton.

Jordan Stojanovski
From: is@groucho.dev.uga.edu (Bob Stearns)
Newsgroups: comp.theory
Subject: Re: Human Computers....
Date: 9 Nov 92 15:31:46 GMT
Organization: University of Georgia

In article <3739@creatures.cs.vt.edu> sahle@csgrad.cs.vt.edu (Eskinder Sahle) writes:
>Hello all:
>
>I need some help....  I'm looking for examples in fiction literature
>of super sophisticated communicative computers a la HAL. That is,
>computers that talk and communicate like humans.  I'm not so much 
>interested in those instances where it's a robot that cannot be
>distinguished from a human being as in computers sounding human without
>being almost totally human-like....  .
>
>Thanks in advance.
>Ahmed 

The canonical, classical answer to this question is Heinlein's
_The_Moon_is_a_Harsh_Mistress. Please note that McCaffrey's _The_Ship
_Who_Sang, referenced earlier is not really a computer but a cyborg.
-- 
Bob Stearns
University of Georgia
is@groucho.dev.uga.edu
(404)542-5110
Newsgroups: comp.theory,sci.math
From: chisnall@cosc.canterbury.ac.nz (The Technicolour Throw-up)
Subject: mathematics and magic! (was Re: St. Augustine on math)
Followup-To: sci.math
Organization: Computer Science,University of Canterbury,New Zealand
Date: Thu, 5 Nov 1992 11:23:27 GMT

From article <1c80mhINNhrp@uwm.edu>, by markh@csd4.csd.uwm.edu (Mark):
> In article <1992Oct22.030903.3350@midway.uchicago.edu> benven@math.uchicago.edu (Elie Benveniste) writes:
>>In connection with the Augustine quotation, it should be noted that in
>>classical Latin, "mathematicus" could mean "sorcerer, soothsayer,
>>necromancer" as well as "mathematician". The common word for "mathematician"
>>was, I think, "geometricus".
> 
> Fitting all the descriptive criteria of what an ancient would have considered
> sorcery: Calculus, Physics (especially Quantum Physics), Electronics and
> Computer Science are all it.
> 
> Just because it all has a logical foundation and has been demystified doesn't
> make it any less magical.

In category theory there are special maps called "natural transformations". 
If you look in MacLane's book you'll see that there is a variation on these
called "extranatural transformations".  Extranatural transformations are also
known as, wait for it, supernatural transformations!!

--
Just my two rubber ningis worth.
Name: Michael Chisnall  (chisnall@cosc.canterbury.ac.nz)
I'm not a .signature virus and nor do I play one on tv.
Newsgroups: comp.theory
From: baldamus@cs.tu-berlin.de (Michael Baldamus)
Subject: Wanted: Contact to approach for technical reports from Stanford University
Organization: Technical University of Berlin, Germany
Date: Thu, 5 Nov 1992 10:43:17 GMT

Dear colleagues,

Does someone know a postal or, preferably, e-mail address which one
can approach for technical reports from the Computer Science
Department of Stanford University?  I am looking for

D.E. Knuth, T.Larrabee, and P.M. Roberts
Mathematical Writing
Report No. STA-CS-88-1193
Dept. of Computer Science, Stanford University

(quoted after the reprint in a 1990 EATCS Bulletin of Ian Parberry's
SIGACT News article "A Guide for New Referees in Theoretical Computer
Science")

I already and unsuccessfully ftp'ed to elib.stanford.edu:cs/KnuthDE. 

Or is it possible to directly approach D.E. Knuth?

Any help will be greatly appreciated.

Thanks
Michael Baldamus
(baldamus@cs.tu-berlin.de)
From: chyde@pecos.ads.com (Clinton Hyde)
Subject: Re: Satisfiability Program Available, lisp.
Organization: Advanced Decision Systems, Mountain View, CA 94043, +1 (415)
	960-7300
	<1992Nov8.151643.23107@CSD-NewsHost.Stanford.EDU>
Date: Fri, 13 Nov 1992 19:19:32 GMT


rather than post it, how about putting it into one of the Lisp
libraries, like Mark K's ?

on same subject, couldn't we get coordinated about the various lisp
libraries around the US/world, and achieve one standard one with
shadows on various continents?

 -- clint
--

Clint Hyde		"Give me a LispM or give me death!" -- anonymous

Advanced Decision Systems/BAH	Internet:  chyde@chesapeake.ads.com
1953 Gallows Rd, Suite 600
Vienna, VA  22182-3934		(703) 902-7130
Newsgroups: comp.theory
From: frank@Cookie.secapl.com (Frank Adams)
Subject: Re: #nodes in avg.tree of given depth?
Date: Thu, 05 Nov 1992 17:43:01 GMT
Organization: Security APL, Inc.
Keywords: binary tree size

In article <96222@netnews.upenn.edu> rymon@linc.cis.upenn.edu (Ron Rymon) writes:
> I second the naturality of random (uniformly distributed) binary trees of
>depth at most d. However, the analysis of the NUMBER of such trees suggest
>a way to draw such trees. Right?

Right.  I almost said so, but didn't want to waste the net bandwidth.  It
turns out that it would have saved more resources if I had included it.
Newsgroups: comp.theory
From: robert@Xenon.Stanford.EDU (Robert Kennedy)
Subject: Re: Is the following problem in NP?
Keywords: NP, polynomials, equations, solvability
Organization: CS Department, Stanford University, California, USA
Date: 10 Nov 92 19:55:54 GMT

jordans@quip.eecs.umich.edu (Jordan Stojanovski) writes:
>Yes: Since there is a finite number of polynomials of bounded degree with
>bounded integer coefficients, the solution is a table lookup, and your
>problem can be solved by a finite automaton.

The polynomial in the input has N variables, where N is the input
size. You have to generate this table "on the fly" once you know N.
Your method is badly exponential. If the polynomial had been
univariate you would have been right.

	-- Robert Kennedy

Robert Kennedy					(415) 723-4532 (office)
robert@cs.stanford.edu				(415) 322-7367 (home voice)
Computer Science Dept., Stanford University	(415) 322-7329 (home tty)
Newsgroups: comp.theory
From: baldamus@cs.tu-berlin.de (Michael Baldamus)
Subject: Wanted: Contact to approach ... - summary
Organization: Technical University of Berlin, Germany
Date: Thu, 12 Nov 1992 20:00:29 GMT

Thanks a lot to the various persons which replied to my request of 5
November.  It turned out that the contact for technical reports from
the computer science department of Stanford University is

	publications@cs.stanford.edu .

A special thanks to Conrado Martinez-Parra from Catalan University of
Technology in Barcelona. He informed me that the particular report I
was looking for was published by The Mathematical Association of
America. The reference is

	D.E. Knuth, T. Larrabee, and P.M. Roberts
        Mathematical Writing
        Notes Series No. 14
	The Mathematical Association of America
	1989 .

A local bookstore informed me that the ISBN number is 

	0-88385-062-1

and that the price is $13.50. This is probably a paperback version.

Michael Baldamus
Newsgroups: comp.theory
From: hrubin@pop.stat.purdue.edu (Herman Rubin)
Subject: Re: Uniform noise in a d-sphere
Organization: Purdue University Statistics Department
Date: Fri, 6 Nov 1992 14:21:09 GMT

In article <1992Nov5.211723.26238@bnlux1.bnl.gov> murphy@sscdaq.phy.bnl.gov (Michael Murphy) writes:

>I am trying to compute uniformly random noise inside a d-dimensional 
>sphere.  I have identified two ways of doing so:

>(1) (Straightforward Monte Carlo method)  Choose a random d-vector from
>the d-hypercube, centered at the origin with extreme points -1 and 1.
>Accept this vector only if it falls inside the unit d-sphere.  This
>method is adequate for low dimensions, but as the dimension increases,
>the volume of the d-sphere is significantly less than the volume of
>the hypercube.  Therefore many samples must be taken until a 'hit' is
>found.  In a high dimension, such as 25, the wait is unbearable.

>(2) A faster, although perhaps wrong approach is:
>   1. Choose an arbitrary d-vector 
>   2. Normalize it so it is a point on the d-dimensional sphere
>   3. Multiply this normalized vector by a random number in [0,1]
>      raised to the 1/dth power.

>I believe that method two works.  However, when I project a large number of
>points in a high dimensional space (e.g. 25) onto the plane (by ignoring all
>but two coordinates), I get something that resembles a square.  My advisor
>is not so sure that this is correct and I can only give an intuitive
>argument as to why it may be true.

This method works if the d-vector consists of independent normal random
variables, but is likely not to work otherwise.  Another method is to
find both one coordinate and the norm of the remaining coordinates and
iterate; this method is more efficient than it looks, can be done without
square roots, but is likely to cost more than the independent normals.
-- 
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907-1399
Phone: (317)494-6054
hrubin@pop.stat.purdue.edu (Internet, bitnet)  
{purdue,pur-ee}!pop.stat!hrubin(UUCP)
From: sanjiva@ecrc.de (Sanjiva Prasad)
Newsgroups: comp.theory
Subject: This year's FST-TCS: what dates and where?
Date: 4 Nov 92 20:20:52 GMT
Reply-To: sanjiva@ecrc.de (Sanjiva Prasad)
Organization: European Computer-Industry Research Centre, Munich


When and on what dates is this year's FST-TCS conference being
held in India?  Please repsond by e-mail to sanjiva@ecrc.de
Thanks.
--
Sanjiva Prasad,  Guest Magus				E-mail: sanjiva@ecrc.de
European Computer Industry Research Centre		Off: +49 89 92 69 91 58
Arabellastrasse 17					Fax: +49 89 92 69 91 70
8000 Muenchen 81, Germany				Res: +49 89 16 33 59
From: dueker@xenon.arc.nasa.gov (The Code Slinger)
Subject: Missed posts of parts of Spaceships in Conway's Life
News-Software: VAX/VMS VNEWS 1.41    
Organization: Computer Sciences Corp
Distribution: usa
Date: Mon, 9 Nov 1992 21:49:00 GMT

I managed to get parts one, two, and six, but missed parts three, four
and five.

Would somebody like to repost them?

I'm not sure that I want to ask for them to be emailed to me, for fear
of being inundated with copy after copy.

Thanx,
   Chris
------------------------------------------------------------------------
"Ah, Benson, you are so mercifully free of the ravages of intelligence!"
"Oh, thank you, Master!"             - from the movie, TIME BANDITS
------------------------------------------------------------------------
dueker@xenon.arc.nasa.gov    |     Proud owner of a 1985 AMIGA 1000!
chris@chuck.arc.nasa.gov     |     Chris Dueker (The Code Slinger)
duke@well.sf.ca.us           |     Mtn. View, CA, USA (Sillycon Valley!)
Newsgroups: comp.theory.cell-automata
From: mather@sees.bangor.ac.uk (Paul Mather)
Subject: Re: popularizations ofcomplexity.
Organization: University of Wales, Bangor
X-Newsreader: Tin 1.1 PL5
Date: Fri, 13 Nov 1992 15:01:20 GMT

Richard J. Gaylord (gaylord@ux1.cso.uiuc.edu) wrote:
> suggestion: you might get levy's book for christmas but skip waldrop  and
> lewin. save your money for some better 'technical' books on the subject .

I've never yet seen a FAQ for this group so I don't feel too bad about
asking whether anyone has any good recommendations for introductory
"technical" books on the subject of (information) complexity?

Cheers,

Paul.

--
e-mail: p.mather@sees.bangor.ac.uk

If your mailer can't reach me, I'm obviously not worth talking to.
Newsgroups: comp.theory.cell-automata
From: wli@physics-sun.ROCKEFELLER.EDU (Wentian Li)
Subject: Re:  Gacs Rule
Organization: The Internet
Distribution: inet
Date: Sun, 8 Nov 1992 06:34:40 GMT

>Aside from the original 1978 Russian paper, has
>anything else been published about this rule?
>
>Thanks.
>Lenore Levine
>levine@symcom.math.uiuc.edu

one recent publication on gacs-kurdymuv-levin rule is:

-----------------------------------------------------------
De Sa and Maes
	The Gacs-Kurdymuv-Levin Automaton Revisited
	Journal of Statistical Physics
	67(3/4) 507--522 (1992)

-----------------------------------------------------------

wentian li
Newsgroups: comp.theory.cell-automata
From: Richard J. Gaylord <gaylord@ux1.cso.uiuc.edu>
Subject: popularizations ofcomplexity.
X-Xxdate: Wed, 11 Nov 92 03:11:40 GMT
X-Useragent: Nuntius v1.1.1d12
Organization: University of Illinois
Date: Wed, 11 Nov 1992 09:11:05 GMT
X-Xxmessage-Id: <A7262A6C6A019B19@mm-mac25.mse.uiuc.edu>


recent popularizations on the subject of complexity, a-life, ca's.

"Complexity" by Roger Lewin

"Complexity" by Waldrop

"Artifical Life" by Levy.

i hope the guys at Santa Fe must keep their machines running while they
give out all these interviews. well, i guess it pays to  advertise.

btw - levy's book is okay, waldrop's book is absolutely awful and lewin's
book has  pictures of the guys, discusssions of who did what first, and 
60's style pseudo-scientific/philosophical babble. 
basically, they all just discuss the people and not the subject  (which
is probably too 'complex'  for them to understand).

suggestion: you might get levy's book for christmas but skip waldrop  and
lewin. save your money for some better 'technical' books on the subject .
Newsgroups: comp.theory.cell-automata
From: pollack@dendrite.cis.ohio-state.edu (Jordan B Pollack)
Subject: Re: Undecidability of configurations/progression
Originator: pollack@dendrite.cis.ohio-state.edu
Reply-To: pollack@cis.ohio-state.edu
Organization: Ohio State Computer Science
Date: Mon, 9 Nov 1992 18:31:40 GMT

>2) Whether a configuration is garden of eden (as demonstrated by previous
>  poster)

there are 3 different problems:

1)  Given a SPECIFIC finite configuration, we can run a deterministic
limited-neighborhood CA BACKWARDS one step.  Generally, one would get
lots of previous states, but a GoE would have 0 previous states.
The size of the previous states would expand at the speed of light.

To do this is straightforward but excessive in computer time. In a 3
by 3 neighborhood, like LIFE, you just enumerate the number of
9-tuples which give rise to either state of a cell, and run an
assumption-based constraint propagation algorithm to ensure a
consistent labelling of each cell. Each assumption would multiply
the number of solutions.

2) Finding a GoE which gives rise to a PARTICULAR configuration is a
much harder problem, as it would require searching through the space
generated by operator 1. Unless the question were asked: "is this
configuration less than K generations from a GoE", it is undecideable.

3) finally, whether or not any GoE's EXIST for a particular CA rule
might be even harder. 

A more interesting question might involve whether the current state in
the smallest bounding box, could have arisen from a "smaller" state.

Then one could invert CA's to build data compression systems:

   Start with 1011 and run rule 247 for 16325 generations,
   then run rule 343 for 932 generations, and ta da: the Mona Lisa!



-- 
Jordan Pollack                            Assistant Professor
CIS Dept/OSU                              Laboratory for AI Research
2036 Neil Ave                             Email: pollack@cis.ohio-state.edu
Columbus, OH 43210                        Phone: (614)292-4890 (then * to fax)
From: rucker@sjsumcs.SJSU.EDU (Rudy Rucker)
Newsgroups: comp.theory.cell-automata
Subject: Re: Looking for a CA Ref
Date: 5 Nov 92 19:38:34 GMT
Article-I.D.: sjsumcs.199211051938.AA02688
Distribution: inet
Organization: The Internet


The rule Louis Howell describes has been investigated by D. Griffeath
among others and is colloquially known (at least by me) as the Eat rule.

Two references are:
A.K.Dewdney, "Computer Recreations: A cellular universe of debris,
droplets, defects and demons" Scientific American, Aug 1989, pp. 102-105
and
D. Griffeath, "Cyclic Random Competition," Notices of the AMS 35, pp. 1472-
1480.

A discussion of the rule can also be found in the manual for the PC
software package JAMES GLEICK'S CHAOS: THE SOFTWARE (Autodesk 1992).  This
package includes a module which runs the Eat rule and allows the user to
alter the parameters of the rule on the fly.
Newsgroups: comp.theory.cell-automata
From: MCINTOSH@UNAMVM1.BITNET ("Harold V. McIntosh")
Subject: Eater rule.
X-Unparsable-Date: Thu, 05 Nov 92 22: 40:18 MEX
Organization: The Internet
Distribution: inet
Date: Sat, 7 Nov 1992 09:34:57 GMT

Louis Howell <howell(at)GROVER.LLNL.GOV> requested literature
concerning Eater Rules; Rudy Rucker <rucker(at)SJSUMCS.SJSU.EDU> has
reported two excellent references. This is a subject for which there
is an ENORMOUS literature, if one takes into account slight variants
on the rule.
-
I hope to be forgiven for not editing the following, and I hope that
our pet ASCII eater doesn't mangle it. I won't know until I see the
echo, and if it is too bad, I will clean it up and retransmit it.
-
Richard Durrett and Jeffrey E. Steif, ``Some Rigorous Results for the
Greenberg-Hastings Model,'' {\em Journal of Theoretical Probability}
{\bf 4} 669-690 (1991).
-
Irving R. Epstein, ``Spiral Waves in Chemistry and Biology,'' {\em
Science} {\bf 252} cover + p. 67 (1991).
-
J. M. Greenberg and S. P. Hastings, ``Spatial patterns for discrete
models of diffusion in excitable media,'' {\em SIAM Journal on Applied
Mathematics} {\bf 34} 515-523 (1978).
-
J. M. Greenberg, B. D. Hassard, and S. P. Hastings, ``Pattern formation
and periodic structures in systems modelled by reaction-diffusion
equations,''{\em Bulletin of the American Mathematical Society} {\bf
84} 1296-1327 (1978).
-
J. M. Greenberg, C. Greene, and S. Hastings, ``A combinatorial problem
arising in the study of reaction-diffusion equations,'' {\em SIAM
Journal of Algebra and Discrete Mathematics} {\bf 1} 34-42 (1980).
v-
Barry F. Madore and Wendy L. Freedman, ``Computer simulations of the
Belousov-Zhabotinsky reaction,'' {\em Science} {\bf 222} 615-616
(1983).
-
James D. Murray, ``How the Leopard Gets its Spots,'' {\em Scientific
American}, pages 62-69 (March, 1988).
-
Arthur T. Winfree, ``Rotating Chemical Reactions,'' {\em Scientific
American}, pages 82-95 (June, 1974).
-
A. T. Winfree, E. M. Winfree and H. Seifert, ``Organizing centers in a
cellular excitable medium,'' {\em Physica} {\bf 17D} 109-115 (1985).
-
There is much more, but this is what is sitting in my files right now; the
Greenberg articles are important for their analysis of the self-sustaining
nucleus; Winfree has done much experimental work with spirals. The leverage
provided by these references should carry one quite a way in Citation Index.
Harold V. McIntosh             |Depto. de Aplicaci'on de Microcomputadoras
MCINTOSH@UNAMVM1.BITNET        |Instituto de Ciencias/UAP
mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461
(+52+22)43-6330                |72000 Puebla, Pue., MEXICO
Newsgroups: comp.theory.cell-automata
From: rthomson@mesa.dsd.es.com (Rich Thomson)
Subject: Re: Missed posts of parts of Spaceships in Conway's Life
Reply-To: rthomson@dsd.es.com (Rich Thomson)
Organization: Design Systems Division, Evans & Sutherland, SLC, UT
Distribution: usa
Date: Tue, 10 Nov 92 05:21:04 GMT

Can someone (the author?) make them available on an FTP site
somewhere?

Furthermore, is there an FTP site specializing in fractals, CA, chaos
and the like?

If so, that would be the perfect place to put it.

						-- Rich
-- 
		      Don't blame me; I voted Libertarian
Disclaimer: I speak for myself, except as noted; Copyright 1992 Rich Thomson
UUCP: ...!uunet!dsd.es.com!rthomson			Rich Thomson
Internet: rthomson@dsd.es.com	IRC: _Rich_		PEXt Programmer
Newsgroups: comp.theory.cell-automata
From: mab@wdl39.wdl.loral.com (Mark A Biggar)
Subject: Re: What is Garden of Eden?
Organization: Loral Western Development Labs
Date: Thu, 5 Nov 1992 23:33:14 GMT

In article <1992Nov5.083342.23825@usage.csd.unsw.OZ.AU> brianm@plod.cbme.unzw.oz.au (Brian Murray) writes:
>What is this "Winning Ways" book to which you refer? Does it contain
>much more life stuff?

"Winning Ways for your mathematical plays: Vol 1 Games in General"
"Winning Ways for your mathematical plays: Vol 2 Games in Particular"
Berlekamp, E.R., Conway, J.H., Guy, R.K.
Academic Press (Harcourt Brace Janovich, Publishers) London 1982
Vol 1 ISBN: 0-12-091101-9
Vol 2 ISBN: 0-12-091102-7

Vol 2 Chapter 25 Pages 817-850 are on life, including a proof that life
is a turing equivalent universal computation system.

--
Mark Biggar
mab@wdl1.wdl.loral.com


Newsgroups: comp.theory.cell-automata