808
Comment:
|
2405
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AddressingModes * AmdahlsLaw * AreaBorderRouter |
|
Line 3: | Line 6: |
* AverageNormalizedExecutionTime * ["Bijection"] * BooleanAlgebra * BooleanTerm * BoothsAlgorithm * CaChe * CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions) |
|
Line 4: | Line 14: |
* CpuTime * CyclesPerInstruction (CPI) * DataPath * ["Decidable"] and SemiDecidable * DelayBandwidthProduct * DelayedBranch * ["Dichotomy"] |
|
Line 5: | Line 22: |
* DisjunctiveSyllogism | |
Line 6: | Line 24: |
* ExecutionTime | |
Line 8: | Line 27: |
* FiveClassicPartsOfaComputer * FixedPoint * FloatingPointRepresentation (IEEE 754) |
|
Line 9: | Line 31: |
* FrameBuffer * FreeBooleanAlgebra * GeometricMean * GroundClause * GroundBooleanTerm * HammingCode * HardwareDesignPrinciples * HypotheticalSylogism |
|
Line 12: | Line 42: |
* InternetProtocolV6 (IPv6) | |
Line 13: | Line 44: |
* InstructionSetArchitecture (ISA) * LogicalImplication (|= symbol and also |-) * LogicalMemory |
|
Line 14: | Line 48: |
* ["Latency"] | |
Line 15: | Line 50: |
* LinkerSteps | |
Line 18: | Line 54: |
* MultiProtocolLabelSwitching (MPLS) | * ModusPonens * MonotoneBooleanTerm * ObjectFile |
Line 21: | Line 59: |
* PageTable * ["Performance"] * PipeLine |
|
Line 22: | Line 63: |
* PowerSet * ["Proposition"] or PropositionalLogic * ["Processor"] or CPU * QueuingTheory * RecursivelyEnumerableSets * ["Register"] (MIPS register) * RelationallyComplete * ResponseTime * RoutingArea |
|
Line 25: | Line 75: |
* SemanticsSyntaxSortsInLogic * SemiDecidable and ["Decidable"] * SequenceNumber * SlidingWindowProtocol * SpatialExtent * SpeedUp * SuperScalar * ["Tautology"] * TcpFastRetransmit * TcpFastRecovery * ThroughPut * TransmissionControlProtocol (TCP) |
|
Line 27: | Line 89: |
* ["Undecidable"] | |
Line 28: | Line 91: |
* VirtualMemory * 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"]
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