1333
Comment:
|
2079
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AmdahlsLaw | |
Line 4: | Line 5: |
* AverageNormalizedExecutionTime * ["Bijection"] * BooleanAlgebra * BooleanTerm |
|
Line 6: | Line 11: |
* CpuTime * CyclesPerInstruction (CPI) * ["Decidable"] and SemiDecidable |
|
Line 8: | Line 16: |
* DelayBandwidthProduct | |
Line 10: | Line 19: |
* ExecutionTime | |
Line 12: | Line 22: |
* FiveClassicPartsOfaComputer * FixedPoint |
|
Line 13: | Line 25: |
* FrameBuffer * FreeBooleanAlgebra * GeometricMean |
|
Line 14: | Line 29: |
* GroundBooleanTerm * HammingCode |
|
Line 20: | Line 37: |
* InstructionSetArchitecture (ISA) | |
Line 22: | Line 40: |
* ["Latency"] | |
Line 27: | Line 46: |
* MultiProtocolLabelSwitching (MPLS) | * MonotoneBooleanTerm |
Line 30: | Line 49: |
* ["Performance"] | |
Line 33: | Line 53: |
* ["Processor"] or CPU * QueuingTheory * RecursivelyEnumerableSets * RelationallyComplete * ResponseTime |
|
Line 38: | Line 63: |
* SemiDecidable and ["Decidable"] | |
Line 40: | Line 66: |
* SpatialExtent * SpeedUp |
|
Line 41: | Line 69: |
* TcpFastRetransmit * TcpFastRecovery * ThroughPut |
|
Line 46: | Line 77: |
* WallClockTime |
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"]
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