|
Size: 2224
Comment:
|
Size: 3097
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * AddressingModes * AmdahlsLaw * AreaBorderRouter * AffineMotion * AutonomousSystem (AS) * AverageNormalizedExecutionTime * ["Bijection"] * BooleanAlgebra * BooleanTerm * BoothsAlgorithm * CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions) * CompleteLogic What does it mean for a logic to be complete * CpuTime * CyclesPerInstruction (CPI) * ["Decidable"] and SemiDecidable * ["Dichotomy"] * DijkstrasAlgorithm * DelayBandwidthProduct * DisjunctiveSyllogism * DistanceVector * ExecutionTime * FirstOrderPredicateLogic * FirstOrderPredicateLogicQuatifiers * FiveClassicPartsOfaComputer * FixedPoint * ForwardingVsRouting * FrameBuffer * FreeBooleanAlgebra * GeometricMean * GroundClause * GroundBooleanTerm * HammingCode * HardwareDesignPrinciples * HypotheticalSylogism * InteriorGatewayRoutingProtocol (IGRP) * InterNet * InternetProtocolV4 (IPv4) * InternetProtocolV6 (IPv6) * InternetWork * InstructionSetArchitecture (ISA) * LogicalImplication (|= symbol and also |-) * IpCheckSum * ["Latency"] * LinearlyDecomposableDomains * LinkerSteps * LinkState * MaximumTransmissionUnit (MTU) * ["Model"] of a logic formula * ModusPonens * MonotoneBooleanTerm * ObjectFile * OpenShortestPathFirst OSPF * OsiModel (7 layer OSI network Model) * ["Performance"] * PredicateSymbols * PowerSet * ["Proposition"] or PropositionalLogic * ["Processor"] or CPU * QueuingTheory * RecursivelyEnumerableSets * ["Register"] (MIPS register) * 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 |
* AbsorptionLaw * AddressingModes * AmdahlsLaw * AreaBorderRouter * AffineMotion * AutonomousSystem (AS) * AverageNormalizedExecutionTime * [[Bijection]] * BooleanAlgebra * BooleanTerm * BoothsAlgorithm * CaChe * CacheBlock * CacheCoherenceProtocols * CacheLine * CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions) * CompleteLogic What does it mean for a logic to be complete * CpuTime * CriticalSection * [[Cryptography]] * CutFreeProof * CyclesPerInstruction (CPI) * DataPath * [[Decidable]] and SemiDecidable * DelayBandwidthProduct * DelayedBranch * [[Dichotomy]] * DijkstrasAlgorithm * DisjunctiveSyllogism * DistanceVector * DynamicSetOperations * ExecutionTime * ExpectedValue * FileSystem (Free BSD) * FirstOrderPredicateLogic * FirstOrderPredicateLogicQuatifiers * FirstOrderTheory * FiveClassicPartsOfaComputer * FixedPoint * FloatingPointRepresentation (IEEE 754) * ForwardingVsRouting * FrameBuffer * FreeBooleanAlgebra * GeometricMean * GraphTheoryPage * GroundClause * GroundBooleanTerm * HammingCode * HardwareDesignPrinciples * HypotheticalSylogism * InformationRetrieval * InteriorGatewayRoutingProtocol (IGRP) * InterNet * InternetProtocolV4 (IPv4) * InternetProtocolV6 (IPv6) * InternetWork * [[Interpolant]] * InstructionSetArchitecture (ISA) * InterfaceMessagingProcessor (IMP) * InvertedFile * LogicalImplication ($$\models$$ and $$\vdash$$) * LogicalMemory (START EDITING HERE) * IpCheckSum * IpSec * [[Latency]] * [[Lattice]] * LeastFixedPoint * LinearlyDecomposableDomains * LinkerSteps * LinkState * MaximumTransmissionUnit (MTU) * MemoryHierarchy * MemoryStallClockCycles * [[Model]] of a logic formula * ModusPonens * MonotoneBooleanTerm * NetworkDelay * ObjectFile * OnesComplement * OpenShortestPathFirst OSPF * OsiModel (7 layer OSI network Model) * PageTable * PartialOrder * [[Performance]] * PipeLine * PoSet (PartiallyOrderedSet) * PostingsFile * PredicateSymbols * PresburgerArithmetic * PowerSet * [[Proposition]] or PropositionalLogic * [[Processor]] or CPU * QueuingTheory * RaceCondition * RecursivelyEnumerableSets * [[Register]] (MIPS register) * RelationallyComplete * ResponseTime * RoutingArea * RoutingInformationProtocol (RIP) * RoutingPathologies * [[Satisfiable]] * SemanticsSyntaxSortsInLogic * SemiAlgebraicSets * SemiDecidable and [[Decidable]] * SemiDefinite * SemiLinearSets * SequenceNumber * SlidingWindowProtocol * SmallComputerSystemsInterface (SCSI) * SpatialExtent * SpeedUp * [[Steganography]] * SuperScalar * [[Tautology]] * [[taxonomy]] * TcpFastRetransmit * TcpFastRecovery * ThroughPut * TransmissionControlProtocol (TCP) * TreeStructures * TruthFunction (notation for $$\vdash$$) * UnaryConstraintDomain * [[Undecidable]] * UninterpretedFunctions * [[https://uptime.is/|Uptime]] * [[Valid]] Logic Formula * VirtualMemory * WallClockTime |
AutonomousSystem (AS)
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
CyclesPerInstruction (CPI)
FileSystem (Free BSD)
FloatingPointRepresentation (IEEE 754)
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
LogicalImplication ($$\models$$ and $$\vdash$$)
LogicalMemory (START EDITING HERE)
MaximumTransmissionUnit (MTU)
Model of a logic formula
OsiModel (7 layer OSI network Model)
Processor or CPU
Register (MIPS register)
TruthFunction (notation for $$\vdash$$)
Valid Logic Formula