Machines Equivalent To The Turing Machine Model
Turing equivalence
Many machines that might be thought to have more computational capability than a simple universal Turing machine can be shown to have no more power (Hopcroft and Ullman p. 159, cf Minsky). They might compute faster, perhaps, or use less memory, or their instruction set might be smaller, but they cannot compute more powerfully (i.e. more mathematical functions). (The Church-Turing thesis hypothesizes this to be true: that anything that can be “computed” can be computed by some Turing machine.)
The sequential-machine models
All of the following are called "sequential machine models" to distinguish them from "parallel machine models" (van Emde Boas (1990) p. 18).
Read more about this topic: Turing Machine Equivalents
Famous quotes containing the words machines, equivalent, machine and/or model:
“Shoes are the first adult machines we are given to master.”
—Nicholson Baker (b. 1957)
“When the apple is ripe it will fall.”
—Irish proverb.
An English equivalent to this might be, “To everything there is a season.”
“The chrysanthemums’ astringent fragrance comes
Each year to disguise the clanking mechanism
Of machine within machine within machine.”
—Wallace Stevens (1879–1955)
“If the man who paints only the tree, or flower, or other surface he sees before him were an artist, the king of artists would be the photographer. It is for the artist to do something beyond this: in portrait painting to put on canvas something more than the face the model wears for that one day; to paint the man, in short, as well as his features.”
—James Mcneill Whistler (1834–1903)