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)
“What persuades men and women to mistake each other from time to time for gods or vermin is ideology. One can understand well enough how human beings may struggle and murder for good material reasons—reasons connected, for instance, with their physical survival. It is much harder to grasp how they may come to do so in the name of something as apparently abstract as ideas. Yet ideas are what men and women live by, and will occasionally die for.”
—Terry Eagleton (b. 1943)
“The Frenchman Jean-Paul ... Sartre I remember now was his last name had a dialectical mind good as a machine for cybernetics, immense in its way, he could peel a nuance like an onion, but he had no sense of evil, the anguish of God, and the possible existence of Satan.”
—Norman Mailer (b. 1923)
“Grandparents can be role models about areas that may not be significant to young children directly but that can teach them about patience and courage when we are ill, or handicapped by problems of aging. Our attitudes toward retirement, marriage, recreation, even our feelings about death and dying may make much more of an impression than we realize.”
—Eda Le Shan (20th century)