Difference between revisions of "Monad"
| (10 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
Monad is a way to preserve [[symmetries]] in the space of functions while | Monad is a way to preserve [[symmetries]] in the space of functions while allowing for maximal [[compositionality]]. It is also Leibniz's way<ref>[[Monadology]]</ref><ref>{{:Video/Leibniz's Monads Explained}}</ref> to stating the notion of [[Digital Twin]] and [[Metaverse]]. | ||
=Monad: Natural numbers as Functors= | |||
{{:Monad: Natural numbers as Functors}} | |||
=[[Don't fear the Monad]]= | =[[Don't fear the Monad]]= | ||
Brian Beckman had an hour-long video that explains Monad in a rather detailed and insightful tutorial<ref>{{:Video/Don't fear the Monad}}</ref>. Therefore, a special page was dedicated to annotate the tutorial with segmented video clips. Just click on this link:[[Don't fear the Monad]], to get access to the annotation. The following is the shortened version of the page: | Brian Beckman had an hour-long video that explains Monad in a rather detailed and insightful tutorial<ref>{{:Video/Don't fear the Monad}}</ref>. Therefore, a special page was dedicated to annotate the tutorial with segmented video clips. Just click on this link:[[Don't fear the Monad]], to get access to the annotation. The following is the shortened version of the page: | ||
| Line 9: | Line 12: | ||
<references/> | <references/> | ||
==Related Pages== | ==Related Pages== | ||
[[Category:Monad]] | |||
[[Category::單子]] | |||
</noinclude> | </noinclude> | ||
Latest revision as of 10:04, 20 March 2022
Monad is a way to preserve symmetries in the space of functions while allowing for maximal compositionality. It is also Leibniz's way[1][2] to stating the notion of Digital Twin and Metaverse.
Monad: Natural numbers as Functors
To model numbers in terms of relations, monad can be used as a bridge. That is based on the fact that functors can be used to represent both elements in a set and the relations of the elements in the set. In other words, the notion of representable is inalienable from the notion of functor, which carries the name of this information compression. Daniel Tubbenhauer's VisualMath also has a video on What are…monads?[3]. In the beginningof the video, he stated that monad is a way of counting.
Don't fear the Monad
Brian Beckman had an hour-long video that explains Monad in a rather detailed and insightful tutorial[4]. Therefore, a special page was dedicated to annotate the tutorial with segmented video clips. Just click on this link:Don't fear the Monad, to get access to the annotation. The following is the shortened version of the page:
Synopsis of Beckman's Tutorial on Monad
- Monad is the way to build complexity from simplicity
- Monad is ruled by one customizable rule that rules them all
- Monad is hard to learn because of a broken symmetry
The idea of Monad can be traced back to the mathematical structure: Monoid, which is just an algebra with one element only. This mathematical structure provides a basis to reduce complexity. As Beckman says:
Monoid helps to guarantee you to build a software with one and only one type ...(start at 1126)
|ZhuHCtR3xq8|||| |start=1126&end=1230}}
References
- ↑ Monadology
- ↑ Leevark, ed. (May 1, 2020). Leibniz's Monads Explained. local page: Leevark.
- ↑ Tubbenhauer, Daniel (Feb 13, 2022). What are…monads?. local page: VisualMath.
- ↑ Beckman, Brian (Nov 21, 2012). Brian Beckman: Don't fear the Monad. local page: jasonofthel33t.