Moore Machine

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:

    What is there

    like fortitude! What sap
    went through that little thread
    to make the cherry red!
    —Marianne Moore (1887–1972)

    The American people is out to get the kaiser. We are bending every nerve and every energy towards that end; anybody who gets in the way of the great machine the energy and devotion of a hundred million patriots is building towards the stainless purpose of saving civilization from the Huns will be mashed like a fly. I’m surprised that a collegebred man like you hasn’t more sense. Don’t monkey with the buzzsaw.
    John Dos Passos (1896–1970)