Monoid (幺半群), according to Wikipedia, it is a set equipped with an associative binary operation and an identity element. It is a foundational algebraic structure that can be applied to many fields.

For instance, in a Turing Machine, all operations can be thought of as some sequences of stack operations^[1]^[2]. This idea has been extended to Bayesian inferencing^[3], and other ideas, such as The Master Algorithm^[4].

References

↑ Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge.
↑ All Angles, ed. (Aug 14, 2021). What is a monoid?. local page: All Angles.
↑ Fong, Brendan (2013). Causal Theories: A Categorical Perspective on Bayesian Networks (Master). local page: University of Oxford. Retrieved Jan 26, 2013.
↑ Domingos, Pedro (February 13, 2018). The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World (Revised ed.). local page: Basic Books. ISBN 978-0465094271.

Related Pages

[1] Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge.

[2] All Angles, ed. (Aug 14, 2021). What is a monoid?. local page: All Angles.

[3] Fong, Brendan (2013). Causal Theories: A Categorical Perspective on Bayesian Networks (Master). local page: University of Oxford. Retrieved Jan 26, 2013.

[4] Domingos, Pedro (February 13, 2018). The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World (Revised ed.). local page: Basic Books. ISBN 978-0465094271.

[1]

[2]

[3]

[4]

Monoid

References

Related Pages

Navigation menu

Search