wasn't a universal machine
Please elaborate.
In the Universal Turing Machine sense, from computing theory. A UTM
can compute a certain class of functions. Any machine with a certain
set of capabilities can be shown to be a UTM equivalent .... I think
it would be difficult to construe the ENIAC into a UTM equivalent.
Oh. That's what I thought you meant, but I figured maybe you actually
meant something else, because ENIAC * was * Turing-complete.
I wouldn't normally use Wikipedia as a credible source, but since you
already did .... says here in the first paragraph:
http://en.wikipedia.org/wiki/ENIAC.
The chart (scroll down the Wiki page) shows how, except for the limited
Mark 1, * all * general-purpose programmable computers are
Turing-complete. (not counting theoretical impossibilities like infinite
memory.)
