Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!iuvax!ux1.cso.uiuc.edu!uxc.cso.uiuc.edu!uxc.cso.uiuc.edu!m.cs.uiuc.edu!p.cs.uiuc.edu!gillies
From: gillies@p.cs.uiuc.edu
Newsgroups: comp.arch
Subject: Re: LEGOs -- computationally complete?
Message-ID: <76700072@p.cs.uiuc.edu>
Date: 4 Oct 89 02:12:00 GMT
References: <3300071@m.cs.uiuc.edu>
Lines: 11
Nf-ID: #R:m.cs.uiuc.edu:3300071:p.cs.uiuc.edu:76700072:000:509
Nf-From: p.cs.uiuc.edu!gillies    Oct  3 21:12:00 1989


There was an article in BYTE back when I had a subscription (about '77
to '80, I believe) on how to build a Turing machine.

They used a big 1-bit DRAM for a tape (sorry, only binary alphabets
were supported).  But it was pretty fast; less than 1 microsecond per
instruction.  Maybe you could hunt up the article for more information.

Don Gillies, Dept. of Computer Science, University of Illinois
1304 W. Springfield, Urbana, Ill 61801      
ARPA: gillies@cs.uiuc.edu   UUCP: {uunet,harvard}!uiucdcs!gillies