Difference between revisions of "Monoid"

From PKC
Jump to navigation Jump to search
Line 1: Line 1:
Monoid is a foundational algebraic structure that can be applied to many fields. Try to keep everything in the same type, such the notion of treating all data in terms of [[Page/File/Service]], so that all elements have the same common features, is a way to control complexity. In other words, [[Monoid]] is a [[Category Theory|category theoretical strategy]] to conduct [[Universal data abstraction]].
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>{{:Causal Theories: A Categorical Perspective on Bayesian Networks}}</ref>,  


In Chinese, Monoid is called: [[wikipedia:zh:幺半群|幺半群]].
In Chinese, Monoid is called: [[wikipedia:zh:幺半群|幺半群]].

Revision as of 12:19, 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],

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


Retrieved from "https://pkc.pub/index.php?title=Monoid&oldid=39214"