Monoid

From PKC
Revision as of 12:19, 5 July 2023 by Benkoo2 (talk | contribs)
Jump to navigation Jump to search

Monoid 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]. This idea has been extended to Bayesian inferencing[2],

In Chinese, Monoid is called: 幺半群.


References

  1. Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge. 
  2. Causal Theories: A Categorical Perspective on Bayesian Networks

Related Pages