HDTenEightyP/NetNews huggingface dataset:
From: craig@grad04.math.ncsu.edu (Ralph Craig)
Subject: Re: xlife: help
Organization: NCSU Mathematics Dept.
Distribution: comp.theory.cell-automata
Date: Wed, 29 Jul 1992 04:10:18 GMT

In article <1992Jul28.044556.24235@ncsu.edu> craig@grad04.math.ncsu.edu (Ralph Craig) writes:
>	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
>

	Thanks for all the replies, but all your help cannot 
save the truely clueless.  I changed the pathway in defs.h 
as instructed then typed "make". the following errors resulted:

cc -O2 -Wf,-XNh2000 -Olimit 2000  -I/usr/local/include  -I/usr/local/include/res      -target sun4 -c  button.c
cc: Warning: Option -Wf,-XNh2000 passed to ld
cc: Warning: File with unknown suffix (2000) passed to ld
cc: Illegal optimization option "-Ol"
*** Error code 1
make: Fatal error: Command failed for target `button.o'

	Let me explain my situation further, I am in an
OpenWindows 2 environment on a Sparcstation IPC.  Any 
assitance would be greatly appreciated.

	On a related note, I am trying to run a copy of the 
cellular automata simulator advertised in this group which
uses HyperLook.  My stumbling block here is that it says with
OpenWindows 2 I need something called TNT2.0.  What is TNT2.0
and where can I get some? (for free).

Ralph Craig (again)
From: rpatil@nmsu.edu (Raj Patil)
Newsgroups: comp.theory.cell-automata
Subject: Cellular Neural Net Implementation.
Date: 30 Jul 92 22:05:08 GMT
Distribution: comp.theory.cell-automata
Organization: Computing Research Lab


Dose anyone have a cellular neural net implementation?

Thanks in advance

regards

raj
From: jpj@jet.uk (Jean-Paul V Jeral)
Newsgroups: comp.theory.cell-automata
Subject: Re: A soup computer
Date: 25 Jul 92 14:23:38 GMT
Organization: Joint European Torus

- - -
Thanks to Eric Iverson, thanks also to Radford Neal, who e-mailed
me the following answer that I think deserves being posted:

>From:           Radford Neal <radford@ai.toronto.edu>
>You might want to check out the following. I think there is a follow-up
>article (maybe two?) in the same journal.
>
>  Allen Hjelmfelt, Edward D. Weinberger and John Ross, Proc. Natl
>  Acad. Sci. USA 88, 10983-10987 (1991), "Chemical implementation of
>  neural networks and Turing machines".
>
  Cheers,
    Jean-Paul Jeral
- - -

- Disclaimer: Please note that the above is a personal view and should not 
  be construed as an official comment from the JET project.
From: jpj@jet.uk (Jean-Paul V Jeral)
Newsgroups: comp.theory.cell-automata
Subject: Re: A soup computer
Date: 26 Jul 92 17:08:59 GMT
Organization: Joint European Torus


- - -

OOOPS! I saw my previous post appear in the News. Sorry: it did
not make sense - a manipulation error had removed part of it.
( Ref of it was <1992Jul25.142338.13938@jet.uk> by jpj@jet.uk)
It should read:

Thanks Eric Iverson. Thanks also to Radford Neil who E-mailed me another
reference which I think deserves to be posted to the Net. Here it is:

>>>start quote>>>
 From:           Radford Neal <radford@ai.toronto.edu>
 You might want to check out the following. I think there is a follow-up
 article (maybe two?) in the same journal.

   Allen Hjelmfelt, Edward D. Weinberger and John Ross, Proc. Natl
   Acad. Sci. USA 88, 10983-10987 (1991), "Chemical implementation of
   neural networks and Turing machines".
<<< End of quote<<<

Cheers,
    Jean-Paul Jeral

 (... and BTW the unimaginative disclaimer which follows is
                            added *automatically* by my organisation :^).
- - -

- Disclaimer: Please note that the above is a personal view and should not 
  be construed as an official comment from the JET project.
Organization: Robotics Institute, Carnegie Mellon, Pittsburgh, PA
Newsgroups: comp.theory.cell-automata
Date: Wed, 29 Jul 1992 12:57:03 -0400 
From: "Jon C. R. Bennett" <jb7m+@andrew.cmu.edu>
Subject: Re: xlife: help
	<1992Jul29.041018.7087@ncsu.edu>
Distribution: comp.theory.cell-automata


craig@grad04.math.ncsu.edu (Ralph Craig) writes:
> cc -O2 -Wf,-XNh2000 -Olimit 2000  -I/usr/local/include  -I/usr/local/include/r\
> es      -target sun4 -c  button.c
> cc: Warning: Option -Wf,-XNh2000 passed to ld
> cc: Warning: File with unknown suffix (2000) passed to ld
> cc: Illegal optimization option "-Ol"
> *** Error code 1
> make: Fatal error: Command failed for target `button.o'

"-Wf,-XNh2000 -Olimit 2000" are all DECstation (MIPS R*000) compilier
options, just remove them from the Makfile.

jon
From: jpj@jet.uk (Jean-Paul V Jeral)
Newsgroups: comp.theory.cell-automata
Subject: Re: A soup computer
Summary: model cell enzymes with dilute neural net
Keywords: soup,enzyme,dilute
Date: 21 Jul 92 10:42:17 GMT
Organization: Joint European Torus

- - -
Once upon a time I attended a lecture where something remotely
relevant to "soup computation" was said. I took note of it.
Now I am unable to find that piece of paper and even to
remember who gave that lecture (It might have been Sherrington).
In the hope that someone can bring in more precision and
reliability, here is what I think I remember (no garantee given!):
<<
In a cell each enzyme synthesis is under the control of 1 or 2
enzymes.
In turn, each enzyme controls the fabrication of 1 or 2 other
enzymes.
This can be thougth of as a DILUTE NEURAL NETWORK.
There are ~ 10000 enzymes.
Dilute neural network theory states that the length of a cycle
is around the square root of the number of neurons (enzymes here).
Complete cell division takes ~10 minutes, 600 secs, which is
roughly Sqrt(10000.)=100. times the time for elementary enzyme
synthesis ~6 secs.
>>
If someone has the exact reference, or can improve/correct/deny
the argument please post in this group.
I hope that this partly answers the original question.
             Jean-Paul Jeral (jpj@jet.uk)
- - -

- Disclaimer: Please note that the above is a personal view and should not 
  be construed as an official comment from the JET project.
Newsgroups: comp.theory
From: vollmer@hamlet.informatik.uni-wuerzburg.de (Heribert Vollmer)
Subject: STACS-deadline/reminder
Originator: vollmer@hamlet
Organization: University of Wuerzburg, Germany
Date: Mon, 27 Jul 1992 13:38:43 GMT

Dear Colleagues,

there are still 18 days to the deadline for
STACS 93. We are waiting for your submission.
Use this unique opportunity to present your
results on Theoretical Computer Science to 
an outstanding audience.

Send your submission to 

Klaus W. Wagner
Lehrstuhl fuer Theoretische Informatik
Universitaet Wuerzburg
Am Exerzierplatz 3
D-W8700 Wuerburg
Germany

The program committee of STACS 93
The organizing committee of STACS 93
===============================================

Online information available via anonymous ftp from
haegar.informatik.uni-wuerzburg.de (132.187.101.41)
Newsgroups: comp.theory
From: kornerup@cs.utexas.edu (Jacob Kornerup)
Newsgroups: comp.theory
Subject: Roommate wanted for CONCUR 92
Date: 28 Jul 92 04:16:38 GMT
Organization: U Texas Dept of Computer Sciences, Austin TX
NNTP-Posting-Host: dimebox.cs.utexas.edu

I'm looking for someone to share a room with for CONCUR 92 at SUNY Stony Brook,
from August 23'rd to 27'th at the Holiday Inn. I'm a male graduate student at
The University of Texas at Austin in Computer Science. Drop me a line if you're
interested.

Jacob Kornerup


-- 
------------------------------------------------------------------------
Jacob Kornerup (kornerup@cs.utexas.edu)     Vir prudens non contra
Department of Computer Sciences             ventum mengit :-)
University of Texas, Austin
Newsgroups: comp.theory
From: ted@aps1.spa.umn.edu (Ted Stockwell)
Subject: multidimensional range searching
Organization: Univ. of Minnesota Astronomy Dept., APS Lab
Date: Sat, 25 Jul 1992 23:01:05 GMT

I'm looking for references on multidimensional range searching.  I
have some info (e.g. kD trees in Sedgewick's "Algorithms"), but I
recall that a good summary was posted here some months ago.  Any
references would be apprecitated.  I'll summarize if there is
interest.

Thanks!
--
"It's not the bullet that kills you, it's the hole."  -- Laurie Anderson
Ted Stockwell, ted@aps1.spa.umn.edu, estockwe@phi.com
Newsgroups: comp.theory
From: marina@tk.mainet.msk.su (Naumenko M.V.)
Subject: To anybody who is interesting in science
Reply-To: marina@tk.mainet.msk.su
Organization: Moscow Aviation Institute, PDTK
Date: Tue, 28 Jul 92 12:54:28 GMT

          TO  ANYBODY  WHO IS INTERESTING IN SCIENCE
        We apply to everybody who interested in  future  Russian
science; who   would  like  to assist  it  to integrate in World
science society.
        We need information about Funds and other  organizations
who interested in  attraction russian  science organizations  to
research within  the limits active and  plan science proects and
directions of  this  researches   but also about  conditions  of
precipitation  russian scientists   in this proects.  Besides we
would like to know about questions of finance.
        We pin   our hopes on  establishment of interaction  and
development of international cooperation.
        Best regards.                 Marina V.Naumenko
From: PANDYA@tifrvax.BITNET
Newsgroups: comp.theory
Subject: List of accepted papers for FST&TCS-12
Date: 29 Jul 92 03:45:59 GMT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A%NDSUVM1.BITNET@cmsa.Berkeley.EDU>,
        PANDYA%tifrvax.BitNet@pucc.PRINCETON.EDU


                   FST & TCS 12 CONFERENCE
                    18-20 December, 1992
                      New Delhi, India


Total Number of Submissions 125
Number of Accepted Papers 29

LIST OF SELECTED PAPERS
========================


V. Arvind, J. Kobler and M. Mundhenk
On Bounded Truth-Table,  Conjunctive,  And  Randomized  Reductions  To
Sparse Sets

Rajamani Sundar
Maintaining  Sequences  Under  Equality-Tests  In Polylogarithmic Ran-
domized Time

K. Ganesan
One-Way Functions And Isomorphism Conjecture

Mads Dam
Fixpoints Of Buchi Automata

S. Jadhav, A. Mukhopadhyay and B. Bhattacharya
An Optimal Algorithm For The Intersection Radius Of A  Set  Of  Convex
Polygons

L. Christoff and I.Christoff
Reasoning About Safety And Liveness Properties

Vijay K. Garg and Brian Waldecker
Detection Of Unstable Predicates In Distributed Programs

Rainer Schuler and T. Tamakami
Structural Average Case Complexity

B. Ravikumar
Some Observations On 2-Way Probabilistic Finite Automata

Wolfgang Reif
Verification of Large Software Systems

P.K. Agarwal and Marc van Kreveld
Implicit Point Location In Arrangements Of Line Segments,  With An Ap-
plication To Motion Planning

V.S. Lakshmanan and Daniel A. Nonen
Superfinitensss Of Query Answers In Deductive Databases: An  Automata-
Theoretic Approach

J. Ian Munro and Venkatesh Raman
Selection From Read-Only Memory And Sorting With Optimum Data Movement

B. Monsuez
Polymorphic Typing By Abstract Interpretation

R. Sundararajan and John S. Conery
An Abstract Interpretation Scheme For Groundness,  Freeness, And Shar-
ing Analysis Of Logic Programs

Y.S. Ramakrishna, L.K. Dillon, L.E. Moser, P.M.M.  Smith and G.  Kutty
An Automata-Theoretic Decision Procedure For Future Interval Logic

Richa Agarwala and D.Fernandez-Baca
Solving The Lagrangian Dual When The Number Of Constraints Is Fixed

Sachin Patkar and H. Narayanan
Fast  Sequential  And  Randomized Parallel Algorithms For Rigidity And
Approximate Min k-cut

J. Steimbach
Proving Polynomials Positive

P. Granger
Improving The Results Of Static Analyses Of Programs By Local Decreas-
ing Iterations

C. Levcopoulos and A. Lingas
C-Sensitive Triangulations Approximate The Minmax Length Triangulation

S. Muthukrishnan and H. Ramesh
String Matching Under A General Matching Relation

Jens C.Godskesen and Kim G. Larsen
Real-Time Calculi And Expansion Theorems

R. Ravi, B. Raghavachari and P. Klein
Approximation Through Local Optimality: Designing Networks With  Small
Degree

Charles Martel and R. Subramonian
On The Complexity Of Certified Write All Algorithms

Didier Caucal
Branching Bisimulation For Context-Free Processes

Gerard Huet
The Gallina Specification Language: A Case Study

M. Mukund and M. Nielsen
CCS, Locations And Asynchronous Transition Systems

Harry Buhrman and Steven Homer
Superpolynomial Circuits For NP And Exponential Time Sets
Newsgroups: comp.theory
From: rowan@cs.uwa.edu.au (Rowan Davies)
Subject: Re: Complexity of Integer Programming.
Reply-To: (null)@cs.uwa.edu.au
Organization: Uni of W. Aust.
Date: Wed, 29 Jul 1992 04:09:13 GMT

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.)

It is definitely NP-Complete (or more precisely, NP-equivalent, since it
is usually not a decision problem).  This can easily be shown by transforming
satisfiability (or many other problems) to IP.

cheers......

Rowan Davies                University of Western Australia
rowan@cs.uwa.edu.au         Pure Mathematics/Computer Science



Newsgroups: comp.theory
From: ivkovich@dewey.udel.edu (Zoran Ivkovich)
Subject: STEINER TREE
Organization: University of Delaware, Newark
Distribution: comp.theory
Date: Fri, 24 Jul 1992 16:44:11 GMT

Could someone help me to obtain the following reference:

A. Z. Zelikovsky, The 11/6 approximation algorithm for the Steiner
problem on networks, to appear in Information and Computation

A hardcopy, LaTex, anything would be fine. Please respond
to ivkovich@dewey.udel.edu.

Thanks!
Newsgroups: comp.theory
From: klauck@dfki.uni-kl.de (Christoph Klauck)
Subject: PARSERS and EDITORS for graph grammars
Reply-To: klauck@dfki.uni-kl.de (Christoph Klauck)
Organization: University of Kaiserslautern, Germany
Date: Mon, 27 Jul 1992 05:58:53 GMT

Hi,
I am looking for any pointers to
	PARSERS, EDITORS or/and "GENERATORS"
for any kind of graph grammars (gg's):
	- attributed gg's
	- node labeled gg's
	- edge labeled gg's
	- any combination of above gg`s
If interest I can post the summary here.
Thank in advance.
	Christoph
From: e_splett@trofs.enet.dec.com (Evan Splett)
Newsgroups: comp.theory
Subject: Re: Category Theory for Computer Scientists
Date: 28 Jul 92 16:37:30 GMT
Organization: Digital Equipment Corp.
Organisation: Digital Equipment of Canada - Ottawa


Here are some references:

C.A.R. Hoare,
Notes on an Approach to Category Theory for Computer Scientists;
in: Constructive Methods in Computing Science
NATO ASI Series, Vol. F55
Edited by M. Broy
Springer-Verlag 1989
ISBN 0-387-51369-8 (U.S.)
ISBN 3-540-51369-8

R. Goldblatt, 
Topoi: The Categorial Analysis of Logic;
North Holland, Revised Edition, 1969.

E.G. Manes and M.A. Arbib,
Algebraic Approaches to Program Semantics;
Springer-Verlag, 1986.

Saunders MacLane,
Categories for the Working Mathematician;
Springer-Verlag, 1971.

J. Lambek and P.J. Scott,
Introduction to Higher Order Categorical Logic;
Cambridge University Press, 1986.

H. Herrlich and G.E. Strecker,
Category Theory, Second Edition,
Helderman Verlag, Berlin 1979.

D.E. Rydeheard and R.M. Burstall,
Computational Category Theory.
Prentice-Hall, 1988.

Basic Category Theory for Computer Scientists
Benjamin C. Pierce 1991 MIT Press ISBN 0-262-66071-7

Benjamin Pierce
"A Taste of Category Theory for Computer Scientists"
CMU-Techreport : CMU-CS-90-113
[ To appear in Computing Surveys ]

Category Theory for Computing Science
Michael Barr and Charles Wells
1990 Prentice Hall ISBN 0-13-120486-6
	
Andrea Asperti and Giuseppe Longo, Categories, Types, and Structures:
An Introduction to Category Theory for the Working Computer Scientist.
MIT Press, 1991.  ISBN 0-262-01125-5.
Newsgroups: comp.theory,comp.parallel
From: jkp@ukc.ac.uk (J.K.Pearson)
Newsgroups: comp.theory
Subject: Complexity of Integer Programming.
Date: 24 Jul 92 13:47:17 GMT
Organization: Electronics Lab, University of Kent at Canterbury, UK.


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.)


Thanks

Justin Pearson
From: fulk@cs.rochester.edu (Mark Fulk)
Newsgroups: comp.theory
Subject: Re: Lower bound independence
Keywords: NP, independence
Date: 24 Jul 92 15:59:59 GMT
Organization: Computer Science Department University of Rochester

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.  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
From: bause@pieter.informatik.uni-dortmund.de (Falko Bause)
Newsgroups: comp.theory
Subject: FORMAL DEFINITION OF A QUEUE
Date: 22 Jul 1992 10:37:32 GMT
Organization: University of Dortmund (FRG)
Distribution: world
Reply-To: bause@ls4.informatik.uni-dortmund.de
NNTP-Posting-Host: pieter
Keywords: Kendall's notation, queueing networks



I'm looking for a formal definition of a queue in a queueing network.
The usual notation introduced by Kendall (e.g. M/M/1-FCFS, M/M/1-PS)
is rather informal and the service (scheduling) discipline is often defined
in prose.

I've found only two references giving a formal definition for
a certain subclass of queues: 
In [1] and [2] a queue consists of a server and a queue for each 
distinguished class of customers. Each queue comprises of several
stations (indicating the position of a customer in that queue).
The service discipline is described by two set of parameters:
a(i,k) := probability that a new arriving customer enters
          station (position) i of queue k      (queue k is the queue
                                                for class k customers)
r(i,k) := service rate for customer in station (position) i of queue k.


As indicated by the titles of the two articles, the authors are interested
in special classes of queues implying a product-form solution of the whole network.
So it is not surprising, that not all queues (e.g. those with several classes
of customers and FCFS service discipline) can be expressed in that formalism.



QUESTION:
Are there any formal definitions of queues for the specification of a wider
range of queues (especially service disciplines) ?


Thanks in advance. Please answer by e-mail.

 
References:

[1] K.M. Chandy, A.J. Martin: "A Charcterization of Product-Form Queuing Networks"
    Journal ACM 30, April 1983, pp. 286-299.
[2] J.P. Hong, G. Kim: "Class dependent queueing disciplines with product form solutions"
    Performance'83, pp. 341-350.


-- 

Falko Bause  ( bause@ls4.informatik.uni-dortmund.de )
Phone: 049-231-755-4893

Universitaet Dortmund, Lehrstuhl Informatik IV,
August-Schmidt-Str. 12
4600 Dortmund 50
Germany
Newsgroups: comp.theory
From: alopez-o@neumann.waterloo.edu (Alex Lopez-Ortiz)
Subject: Lower bound independence
Keywords: NP, independence
Organization: University of Waterloo
Date: Thu, 23 Jul 1992 20:43:21 GMT

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.

Does anybody knows the reference, either to the survey or the original
paper where this was proven.

Alex L-0.

-- 
Alex Lopez-Ortiz                              alopez-o@maytag.UWaterloo.ca
Deparment of Computer Science                       University of Waterloo
Waterloo, Ontario                                                   Canada
From: e_splett@trofs.enet.dec.com (Evan Splett)
Subject: Re: Category Theory for Computer Scientists
Organisation: Digital Equipment of Canada - Ottawa
Organization: Digital Equipment Corp.
Date: Wed, 29 Jul 1992 15:01:15 GMT


>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,

Thanks, I had copied it from an earlier posting.

    Evan.
From: ag129@cl.cam.ac.uk (Alasdair Grant)
Newsgroups: comp.theory
Subject: Re: Category Theory for Computer Scientists
Date: 27 Jul 92 19:09:36 GMT
Reply-To: ag129@cl.cam.ac.uk (Alasdair Grant)
Organization: U of Cambridge Comp Lab, UK

In article <1992Jul23.165456.799@morrow.stanford.edu> minch@lotka.stanford.edu (Eric Minch) writes:
>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)?

More likely to be "Category Theory for Computing Science" by Barr and
Wells, also Prentice-Hall (>=1990). It is readily available. 
Newsgroups: comp.theory,sci.math
From: serdar@fawlty8.eng.monash.edu.au (Serdar Boztas)
Subject: List of NP-Complete Problems 
Organization: Monash University, Melb., Australia.
Date: Thu, 30 Jul 1992 04:51:33 GMT

I know about the Garey & Johnson list at the end of their book 'Computers
and Intractability'. Does anyone know of an updated list of problems
known to be NP-Complete?

Serdar
-- 
Inhabited by absurd fears,  they only discuss  the puerilities with which 
every fool is familiar, and dare not, by turning a bold hand to the human 
heart, offer its gigantic idiosyncrasies to our views.     Sade, 'Justine'
Serdar Boztas \\ serdar@fawlty1.eng.monash.edu.au \\ +(61)3-565-5722
From: mwprange@vela.acs.oakland.edu (Manfred W. Prange)
Subject: DataMag Address / Telephone needed
Keywords: tapes
Organization: Oakland University, Rochester MI.
Date: Wed, 22 Jul 1992 10:17:09 GMT

I am looking for the address or telephone number of DataMag, a
cartridge tape manufacturer. I bought several tapes under the Lyben
label but they are no longer selling them.

Thanks. mwprange@vela.acs.oakland.edu
From: dcostanz@gmuvax.gmu.edu
Newsgroups: comp.periphs
Subject: DATACOPY 210 scanner help
Date: 22 Jul 92 12:36:29 -0500
Organization: George Mason University, Fairfax, VA.

I have inherited an old DATACOPY 210 desktop scanner.
Anyone have a clue as to what modern OCR software would
support that model?  Or, does anyone know what happened
to the DATACOPY company?  They appear to have been bought
out or gone out of business.

We need to do some basic text to ASCII scanning.  Thanks.


David
From: bheinz@tbag.UUCP (Bill Heinz)
Newsgroups: comp.periphs
Subject: Netting 2 amigas
Date: 27 Jul 92 02:38:26 EST
Organization: Tampa Bay Amiga Group

Can anyone help me with this..I have seen hacks about using a single HD with 2 amigas...Netted between the parralel ports..Anyone ever done this? could it work? I have an Amiga 500 Supra SCSI controller and a 1000...

--- Via UCI v1.02 (C-Net Amiga)

Newsgroups: comp.periphs
From: chan_wing@tandem.com (Wing Chan)
Subject: Wanted info: SCSI to PertecFS1000 adapter
Followup-To: comp.periphs
Organization: Tandem Computers, Cupertino CA
Date: Fri, 24 Jul 1992 16:51:26 GMT

I'm putting together a tape emulator (host has a pertec mag tape port), my
computer
has a SCSI interface port. I need a "black-box" that act as a tape drive to
the
host and I can talk to it through the SCSI interface to extract data that
it receives.

Wing