Difference between revisions of "Composition"
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
==Talks about Combinators and Enumerable Sets here== | ==Talks about Combinators and Enumerable Sets here== | ||
Particularly talks about [[SK Combinators]], and showing that these ideas, and enumerability, determines whether certain kinds of building blocks can be recursively composed or not. | Particularly talks about [[SK Combinators]], and showing that these ideas, and enumerability, determines whether certain kinds of building blocks can be recursively composed or not. Watch Dana Scott's lecture 3<ref>[[https://youtu.be/8zk0yS8Jp5w?t=2100 Recursively Enumerable Sets]]</ref>on Lambda Calculus. | ||
<noinclude> | <noinclude> | ||
Revision as of 05:20, 20 January 2022
Composition is closely related to Monad and Symmetry.
Symmetries as the first Meta-Rule
According to Mathemaniac, symmetries can be thought of as mathematical operands that gets to be manipulated through some operations that preserves the properties of being symmetrical. These four most general properties are:
- Closure: Symmetrical operations on symmetries always create symmetries
- Associativity: Symmetries composition with symmetries are symmetries Associative
- Identity/Unit: Doing nothing is a symmetrical operation
- Inverse Exists: Symmetrical operations can be undone, and returns to the original symmetry.
A mathematical treatment of this subject was explained by Norm Wilberger in a video[1].
Talks about Combinators and Enumerable Sets here
Particularly talks about SK Combinators, and showing that these ideas, and enumerability, determines whether certain kinds of building blocks can be recursively composed or not. Watch Dana Scott's lecture 3[2]on Lambda Calculus.
References
Related Pages
- ↑ Wildberger, Norman J. (Nov 24, 2021). A (somewhat) new paradigm for mathematics and physics. local page: Insights into Mathematics.
- ↑ [Recursively Enumerable Sets]