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:
“How many things served us but yesterday as articles of faith, which today we deem but fables?”
—Michel de Montaigne (1533–1592)
“If we take in our hand any volume; of divinity or school metaphysics, for instance; let us ask, Does it contain any abstract reasoning concerning quantity or number? No. Does it contain any experimental reasoning, concerning matter of fact and existence? No. Commit it then to flames: for it can contain nothing but sophistry and illusion.”
—David Hume (1711–1776)
“The American people is out to get the kaiser. We are bending every nerve and every energy towards that end; anybody who gets in the way of the great machine the energy and devotion of a hundred million patriots is building towards the stainless purpose of saving civilization from the Huns will be mashed like a fly. I’m surprised that a collegebred man like you hasn’t more sense. Don’t monkey with the buzzsaw.”
—John Dos Passos (1896–1970)
“The parents who wish to lead a quiet life I would say: Tell your children that they are very naughty—much naughtier than most children; point to the young people of some acquaintances as models of perfection, and impress your own children with a deep sense of their own inferiority. You carry so many more guns than they do that they cannot fight you. This is called moral influence and it will enable you to bounce them as much as you please.”
—Samuel Butler (1835–1902)