In the theory of computation, a Moore machine is a finite-state machine whose output values are determined solely by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. The Moore machine is named after Edward F. Moore, who presented the concept in a 1956 paper, “Gedanken-experiments on Sequential Machines.”
Read more about Moore Machine: Formal Definition, Comparison, Gedanken-experiments
Famous quotes containing the words moore and/or machine:
“That devilish Iron Horse, whose ear-rending neigh is heard throughout the town, has muddied the Boiling Spring with his foot, and he it is that has browsed off all the woods on Walden shore, that Trojan horse, with a thousand men in his belly, introduced by mercenary Greeks! Where is the country’s champion, the Moore of Moore Hall, to meet him at the Deep Cut and thrust an avenging lance between the ribs of the bloated pest?”
—Henry David Thoreau (1817–1862)
“The cycle of the machine is now coming to an end. Man has learned much in the hard discipline and the shrewd, unflinching grasp of practical possibilities that the machine has provided in the last three centuries: but we can no more continue to live in the world of the machine than we could live successfully on the barren surface of the moon.”
—Lewis Mumford (1895–1990)