Articles Concerning Turing-equivalent Sequential Abstract Machine Models
An approach is to take a somewhat formal taxonomic approach to classify the Turing equivalent abstract machines. This taxonomy does not include finite automata:
Family: Turing-equivalent (TE) abstract machine:
Subfamilies:
- Subfamily (1) Sequential TE abstract machine
- Subfamily (2) Parallel TE abstract machine
Subfamily (1)-- Sequential TE abstract machine model: There are two classes (genera) of Sequential TE abstract machine models currently in use (cf van Emde Boas, for example):
- Genus (1.1) Tape-based Turing machine model
- Genus (1.2) Register-based register machine
Genus (1.1) -- Tape-based Turing machine model: This includes the following "species":
- { single tape, Multi-tape Turing machine, deterministic Turing machine, Non-deterministic Turing machine, Wang B-machine, Post-Turing machine, Oracle machine, Universal Turing machine }
Genus (1.2)-- The register machine model: This includes (at least) the following four "species" (others are mentioned by van Emde Boas):
- { (1.2.1) Counter machine, (1.2.2) Random access machine RAM, (1.2.3) Random access stored program machine RASP, (1.2.4) Pointer machine }
- Species (1.2.1) -- Counter machine model:
- { abacus machine, Lambek machine, Melzak model, Minsky machine, Shepherdson-Sturgis machine, program machine, etc. }
- Species (1.2.2) -- Random access machine (RAM) model:
- { any counter-machine model with additional indirect addressing, but with instructions in the state machine in the Harvard architecture; any model with an "accumulator" with additional indirect addressing but instructions in the state machine in the Harvard architecture }
- Species (1.2.3) -- Random access stored program machine (RASP) model includes
- { any RAM with program stored in the registers similar to the Universal Turing machine i.e. in the von Neumann architecture }
- Species (1.2.4)-- Pointer machine model includes the following:
- = { Schönhage Storage Modification Machine SMM, Kolmogorov-Uspensky KU-machine, Knuth linking automaton }
Read more about this topic: Abstract Machine
Famous quotes containing the words articles, abstract, machine and/or models:
“It was not sufficient for the disquiet of our minds that we disputed at the end of seventeen hundred years upon the articles of our own religion, but we must likewise introduce into our quarrels those of the Chinese. This dispute, however, was not productive of any great disturbances, but it served more than any other to characterize that busy, contentious, and jarring spirit which prevails in our climates.”
—Voltaire [François Marie Arouet] (1694–1778)
“Alice grown lazy, mammoth but not fat,
Declines upon her lost and twilight age;
Above in the dozing leaves the grinning cat
Quivers forever with his abstract rage....”
—Allen Tate (1899–1979)
“The machine is impersonal, it takes the pride away from a piece of work, the individual merits and defects that go along with all work that is not done by a machine—which is to say, its little bit of humanity.”
—Friedrich Nietzsche (1844–1900)
“The greatest and truest models for all orators ... is Demosthenes. One who has not studied deeply and constantly all the great speeches of the great Athenian, is not prepared to speak in public. Only as the constant companion of Demosthenes, Burke, Fox, Canning and Webster, can we hope to become orators.”
—Woodrow Wilson (1856–1924)