|
Size: 1767
Comment:
|
Size: 2046
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * AmdahlsLaw | |
| Line 4: | Line 5: |
| * AverageNormalizedExecutionTime | |
| Line 9: | Line 11: |
| * CpuTime | |
| Line 18: | Line 21: |
| * FiveClassicPartsOfaComputer | |
| Line 20: | Line 24: |
| * FrameBuffer | |
| Line 21: | Line 26: |
| * GeometricMean | |
| Line 23: | Line 29: |
| * HammingCode | |
| Line 29: | Line 36: |
| * InstructionSetArchitecture (ISA) | |
| Line 31: | Line 39: |
| * ["Latency"] | |
| Line 43: | Line 52: |
| * ["Processor"] or CPU | |
| Line 60: | Line 70: |
| * ThroughPut | |
| Line 65: | Line 76: |
| * WallClockTime |
AutonomousSystem (AS)
- ["Bijection"]
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
["Decidable"] and SemiDecidable
- ["Dichotomy"]
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
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula