|
Size: 2650
Comment:
|
Size: 2816
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 13: | Line 13: |
| * CacheCoherenceProtocols | |
| Line 27: | Line 28: |
| * DynamicSetOperations | |
| Line 32: | Line 34: |
| * FirstOrderTheory | |
| Line 39: | Line 42: |
| * GraphTheoryPage | |
| Line 44: | Line 48: |
| * InformationRetrievalSystem | * InformationRetrieval |
| Line 56: | Line 60: |
| * LeastFixedPoint | |
| Line 73: | Line 78: |
| * PresburgerArithmetic | |
| Line 94: | Line 100: |
| * ["taxonomy"] | |
| Line 98: | Line 105: |
| * ["taxonomy"] | * TreeStructures |
AutonomousSystem (AS)
- ["Bijection"]
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
CyclesPerInstruction (CPI)
["Decidable"] and SemiDecidable
- ["Dichotomy"]
FileSystem (Free BSD)
FloatingPointRepresentation (IEEE 754)
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
LogicalImplication (|= symbol and also
- ["Latency"]
MaximumTransmissionUnit (MTU)
- ["Model"] of a logic formula
OsiModel (7 layer OSI network Model)
- ["Performance"]
["Proposition"] or PropositionalLogic
- ["Processor"] or CPU
- ["Register"] (MIPS register)
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula