Computer science eponyms: Difference between revisions
No edit summary |
No edit summary |
||
| Line 297: | Line 297: | ||
* Popek-Goldberg virtualization requirements | * Popek-Goldberg virtualization requirements | ||
* Post's correspondence problem | * Post's correspondence problem | ||
* <b>Post's Lattice</b> is the lattice of all clones on {0,1}, ordered by inclusion. It is used to prove sets of connectives to be functionally complete (e.g. NAND and NOR both generate functionally complete Boolean algebras). | |||
* Postel's Law | * Postel's Law | ||
* Prim's Algorithm | * Prim's Algorithm | ||