Difference between revisions of "Partially-ordered set"
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
==Related Pages== | ==Related Pages== | ||
*[[logically related::Ordered relation]] | |||
*[[logically related::Arrow]] | |||
*[[logically related::Function]] | *[[logically related::Function]] | ||
*[[logically related::Tuple]] | *[[logically related::Tuple]] | ||
</noinclude> | </noinclude> | ||
Revision as of 09:37, 7 September 2021
Partially-ordered sets (POSet) are composed of directed relations, similar to a tuple whose data entries' ordered relations is a crucial aspect of information encoding. According to Data Scott[1], a Partially-ordered set, also known as: POSet, is the most universal building block for the theory of computation.
References
- ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group.