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:
“Though he is captive,
his mighty singing
says, satisfaction is a lowly
thing, how pure a thing is joy.
This is mortality,
this is eternity.”
—Marianne Moore (1887–1972)
“The chrysanthemums’ astringent fragrance comes
Each year to disguise the clanking mechanism
Of machine within machine within machine.”
—Wallace Stevens (1879–1955)