COMPLETE PARTIAL ORDERING

  

Copyright © Philip M. Parker, INSEAD. Terms of Use.

COMPLETE PARTIAL ORDERING

Specialty Definition: COMPLETE PARTIAL ORDERING

DomainDefinition

Computing

Complete partial ordering (cpo) A partial ordering of a set under a relation, where all directed subsets have a least upper bound. A cpo is usually defined to include a least element, bottom (David Schmidt calls this a pointed cpo). A cpo which is algebraic and boundedly complete is a (Scott) domain. (1994-11-30). Source: The Free On-line Dictionary of Computing.

Source: compiled by the editor from various references; see credits.

Top     

Crosswords: COMPLETE PARTIAL ORDERING

Specialty definitions using "COMPLETE PARTIAL ORDERING": cpo. (references)

Top     

Alternative Orthography: COMPLETE PARTIAL ORDERING


Hexadecimal (or equivalents, 770AD-1900s) (references)

43 4F 4D 50 4C 45 54 45      50 41 52 54 49 41 4C      4F 52 44 45 52 49 4E 47

Leonardo da Vinci (1452-1519; backwards) (references)

        

Binary Code (1918-1938, probably earlier) (references)

01000011 01001111 01001101 01010000 01001100 01000101 01010100 01000101 00100000 01010000 01000001 01010010 01010100 01001001 01000001 01001100 00100000 01001111 01010010 01000100 01000101 01010010 01001001 01001110 01000111

HTML Code (1990) (references)

&#67 &#79 &#77 &#80 &#76 &#69 &#84 &#69 &#32 &#80 &#65 &#82 &#84 &#73 &#65 &#76 &#32 &#79 &#82 &#68 &#69 &#82 &#73 &#78 &#71

ISO 10646 (1991-1993) (references)

0043 004F 004D 0050 004C 0045 0054 0045      0050 0041 0052 0054 0049 0041 004C      004F 0052 0044 0045 0052 0049 004E 0047

Encryption (beginner's substitution cypher): (references)

374947504639543925035525443354624952383952434841

Top     



INDEX

1. Crosswords
2. Orthography
3. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.