|
Size: 1453
Comment:
|
Size: 1784
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 4: | Line 4: |
| * ["Bijection"] * BooleanAlgebra * BooleanTerm |
|
| Line 9: | Line 12: |
| * DelayBandwidthProduct | |
| Line 11: | Line 15: |
| * ExecutionTime | |
| Line 15: | Line 20: |
| * FreeBooleanAlgebra | |
| Line 16: | Line 22: |
| * GroundBooleanTerm | |
| Line 29: | Line 36: |
| * MultiProtocolLabelSwitching (MPLS) | * MonotoneBooleanTerm |
| Line 32: | Line 39: |
| * ["Performance"] | |
| Line 35: | Line 43: |
| * QueuingTheory * RecursivelyEnumerableSets |
|
| Line 36: | Line 46: |
| * ResponseTime | |
| Line 44: | Line 55: |
| * SpatialExtent * SpeedUp |
|
| Line 45: | Line 58: |
| * TcpFastRetransmit * TcpFastRecovery * ThroughPut |
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
MaximumTransmissionUnit (MTU)
- ["Model"] of a logic formula
OsiModel (7 layer OSI network Model)
- ["Performance"]
["Proposition"] or PropositionalLogic
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula