Difference between revisions of "Partially-ordered set"
Jump to navigation
Jump to search
(Created page with "Partially-ordered sets are composed of directed relations, similar to a tuple whose data entries' ordered relations is a crucial aspect of information encoding. According to D...") |
|||
| Line 1: | Line 1: | ||
Partially-ordered sets 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. | ||
Revision as of 04:48, 6 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.
- ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group.