• Corpus ID: 11712251

The Smallest Arithmetic Logic Unit

@inproceedings{Rojas2010TheSA,
  title={The Smallest Arithmetic Logic Unit},
  author={R. Rojas},
  year={2010}
}
There have been many designs for „small universal computers“. The Turing machine (1936), for example, remains unsurpassed: it consists only of memory, and a small processor with a few number of internal states. The memory can be designed to store only binary digits (0 and 1) and the number of states can be minimized. Scheming minimal universal Turing machines has been a mental sport for years [1]. 

References

SHOWING 1-4 OF 4 REFERENCES
Conditional Branching Is Not Necessary for Universal Computation in Von Neumann Computers
In this paper we discuss the issue of the minimal instruction set necessary for universal computation. Our computing model is a machine consisting of a processor with a single n-bit register and a
Computation: Finite and Infinite Machines
From the Preface (See Front Matter for full Preface) Man has within a single generation found himself sharing the world with a strange new species: the computers and computer-like machines.
On folk theorems
  • D. Harel
  • Computer Science, Philosophy
    SIGA
  • 1980
TLDR
Criteria for a statement to be a folk theorem is suggested and the ideas are illustrated with a detailed example.
Mollenhoff, Atanasoff: Forgotten Father of the Computer, Iowa
  • 1988