Difference between revisions of "Partially-ordered set"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
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<ref>{{:Paper/Outline of a Mathematical Theory of Computation}}</ref>, a [[Partially-ordered set]], also known as: [[POSet]], is the most universal building block for the theory of computation. | 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<ref>{{:Paper/Outline of a Mathematical Theory of Computation}}</ref>, a [[Partially-ordered set]], also known as: [[POSet]], is the most universal building block for the theory of computation. | ||
=Critical Revelation in Programming= | |||
Knowing that [[POSet]] is a universal data structure, that means all programs are some variants of [[POSet]]. This singular minded idea allows one to think of any data structure processing algorithm as if they are traversing some [[POSet]], or in an other word:[[Tree]]. This revelation helps us to see that all databases should be managed in terms of some kind of [[POSet]], and therefore, should be taught and programmed accordingly. | |||
<noinclude> | <noinclude> | ||
| Line 6: | Line 10: | ||
==Related Pages== | ==Related Pages== | ||
[[Category:Tree]] | |||
</noinclude> | </noinclude> | ||
Revision as of 14:02, 18 January 2022
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.
Critical Revelation in Programming
Knowing that POSet is a universal data structure, that means all programs are some variants of POSet. This singular minded idea allows one to think of any data structure processing algorithm as if they are traversing some POSet, or in an other word:Tree. This revelation helps us to see that all databases should be managed in terms of some kind of POSet, and therefore, should be taught and programmed accordingly.
References
- ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group.