Abstract
Abstract The representation of the Universal Computing Machine in the guise of the stored-program digital computer is now well known among serious students of computer science. On the periphery, a modem generation of technologists seems unable to conceive of a time when “computer” meant “a person who computes” and the concept of “programming” was not ubiquitous. For practical reasons, a modem computer is much more complex than is minimally necessary to achieve universality. The original formulation of a Universal Computing Machine (Turing 1936-7) involved a table based upon 15 symbols and 28 states with no restriction imposed on the length of a sequence of atomic acts (“move” and “print”) permitted prior to a change in state. An aboriginal use of macros simplified the description.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
