[Michael.Witbrock@CS.CMU.EDU]

Jim Hendler argues for the non turing equivalence of SUNs on the basis
of their backing store limitation.

A SUN with access to unlimited memory (rather difficult to arrange given
the limited address space of its mpu) could be shown to be turing
equivalent, however. 

Similarly, it should be possible to prove the result for a network which
can grow extra units and connections in unlimited number. This would be
more satisfying than Jordan Pollack's neuring machine.

michael