Difference between revisions of "Monoid"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
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<ref>{{:Paper/mov is Turing-complete}}</ref>. This idea has been extended to Bayesian inferencing<ref>{{:Thesis/Causal Theories: A Categorical Perspective on Bayesian Networks}}</ref>, | Monoid ([[wikipedia:zh:幺半群|幺半群]]) 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<ref>{{:Paper/mov is Turing-complete}}</ref>. This idea has been extended to Bayesian inferencing<ref>{{:Thesis/Causal Theories: A Categorical Perspective on Bayesian Networks}}</ref>, | ||
<noinclude> | <noinclude> | ||
Revision as of 12:20, 5 July 2023
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],
References
- ↑ Dolan, Stephen (July 19, 2013). "mov is Turing-complete" (PDF). local page: Computer Laboratory, University of Cambridge.
- ↑ Fong, Brendan (2013). Causal Theories: A Categorical Perspective on Bayesian Networks (Master). local page: University of Oxford. Retrieved Jan 26, 2013.
Related Pages