Differences between revisions 49 and 136 (spanning 87 versions)
Revision 49 as of 2003-10-13 22:28:25
Size: 1269
Editor: yakko
Comment:
Revision 136 as of 2008-10-24 02:26:25
Size: 2994
Editor: 209-142-131-35
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
   * AdvertisedWindow
   * AreaBorderRouter
   * AffineMotion
   * AutonomousSystem (AS)
   * CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
   * CompleteLogic What does it mean for a logic to be complete
   * ["Dichotomy"]
   * DijkstrasAlgorithm
   * DisjunctiveSyllogism
   * DistanceVector
   * FirstOrderPredicateLogic
   * FirstOrderPredicateLogicQuatifiers
   * ForwardingVsRouting
   * HypotheticalSylogism
   * InteriorGatewayRoutingProtocol (IGRP)
   * InterNet
   * InternetProtocolV4 (IPv4)
   * InternetProtocolV6 (IPv6)
   * InternetWork
   * LogicalImplication (|= symbol and also |-)
   * IpCheckSum
   * LinearlyDecomposableDomains
   * LinkState
   * MaximumTransmissionUnit (MTU)
   * ["Model"] of a logic formula
   * ModusPonens
   * MultiProtocolLabelSwitching (MPLS)
   * OpenShortestPathFirst OSPF
   * OsiModel (7 layer OSI network Model)
   * PredicateSymbols
   * PowerSet
   * ["Proposition"] or PropositionalLogic
   * RoutingArea
   * RoutingInformationProtocol (RIP)
   * RoutingPathologies
   * ["Satisfiable"]
   * SemanticsSyntaxSortsInLogic
   * SequenceNumber
   * ["Tautology"]
   * ["taxonomy"]
   * UnaryConstraintDomain
   * ["Undecidable"]
   * ["Valid"] Logic Formula
 * 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 ([[latex2($$\models$$)]] and [[latex2($$\vdash$$)]])
 * LogicalMemory (START EDITING HERE)
 * IpCheckSum
 * ["Latency"]
 * 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 [[latex2($\vdash$)]])
 * UnaryConstraintDomain
 * ["Undecidable"]
 * UninterpretedFunctions
 * ["Valid"] Logic Formula
 * VirtualMemory
 * WallClockTime

ComputerTerms (last edited 2020-02-02 17:49:07 by scot)