|
Size: 63
Comment:
|
Size: 3019
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| Notice that some terms here may be described using Tex/LaTex | * 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 (<<latex($\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 * 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 * SpatialExtent * SpeedUp * [[Steganography]] * SuperScalar * [[Tautology]] * [[taxonomy]] * TcpFastRetransmit * TcpFastRecovery * ThroughPut * TransmissionControlProtocol (TCP) * TreeStructures * TruthFunction (notation for <<latex($\vdash$)>>) * UnaryConstraintDomain * [[Undecidable]] * UninterpretedFunctions * [[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 (<<latex($\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 <<latex($\vdash$)>>)
Valid Logic Formula