Partially-ordered set

From PKC
Revision as of 04:47, 6 September 2021 by Admin (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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[1], a Partially-ordered set, also known as: POSet, is the most universal building block for the theory of computation.

  1. ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group. 
Retrieved from "https://pkc.pub/index.php?title=Partially-ordered_set&oldid=11964"