|
Size: 134
Comment:
|
Size: 1985
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * InternetGatewayRoutingProtocol IGRP * InternetProtocolV4 |
* AmdahlsLaw * AreaBorderRouter * AffineMotion * AutonomousSystem (AS) * AverageNormalizedExecutionTime * ["Bijection"] * BooleanAlgebra * BooleanTerm * CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions) * CompleteLogic What does it mean for a logic to be complete * CpuTime * ["Decidable"] and SemiDecidable * ["Dichotomy"] * DijkstrasAlgorithm * DelayBandwidthProduct * DisjunctiveSyllogism * DistanceVector * ExecutionTime * FirstOrderPredicateLogic * FirstOrderPredicateLogicQuatifiers * FixedPoint * ForwardingVsRouting * FrameBuffer * FreeBooleanAlgebra * GeometricMean * GroundClause * GroundBooleanTerm * HammingCode * HypotheticalSylogism * InteriorGatewayRoutingProtocol (IGRP) * InterNet * InternetProtocolV4 (IPv4) * InternetProtocolV6 (IPv6) |
| Line 4: | Line 35: |
| * InstructionSetArchitecture (ISA) * LogicalImplication (|= symbol and also |-) |
|
| Line 5: | Line 38: |
| * OpenShortPathFirst OSPF | * ["Latency"] * LinearlyDecomposableDomains * LinkState * MaximumTransmissionUnit (MTU) * ["Model"] of a logic formula * ModusPonens * MonotoneBooleanTerm * OpenShortestPathFirst OSPF * OsiModel (7 layer OSI network Model) * ["Performance"] * PredicateSymbols * PowerSet * ["Proposition"] or PropositionalLogic * QueuingTheory * RecursivelyEnumerableSets * RelationallyComplete * ResponseTime * RoutingArea * RoutingInformationProtocol (RIP) * RoutingPathologies * ["Satisfiable"] * SemanticsSyntaxSortsInLogic * SemiDecidable and ["Decidable"] * SequenceNumber * SlidingWindowProtocol * SpatialExtent * SpeedUp * ["Tautology"] * TcpFastRetransmit * TcpFastRecovery * ThroughPut * TransmissionControlProtocol (TCP) * ["taxonomy"] * UnaryConstraintDomain * ["Undecidable"] * ["Valid"] Logic Formula * 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
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula