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:
“Camels are snobbish
and sheep, unintelligent; water buffaloes, neurasthenic—
even murderous.
Reindeer seem over-serious.”
—Marianne Moore (1887–1972)
“All day long the machine waits: rooms,
stairs, carpets, furniture, people
those people who stand at the open windows like objects
waiting to topple.”
—Anne Sexton (1928–1974)