Diff for "ComputerTerms"

Differences between revisions 58 and 93 (spanning 35 versions)

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)
DataPath
["Decidable"] and SemiDecidable
["Dichotomy"]
DijkstrasAlgorithm
DelayBandwidthProduct
DisjunctiveSyllogism
DistanceVector
ExecutionTime
FirstOrderPredicateLogic
FirstOrderPredicateLogicQuatifiers
FiveClassicPartsOfaComputer
FixedPoint
FloatingPointRepresentation (IEEE 754)
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"]
PipeLine
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

-  ⇤ ← Revision 58 as of 2003-11-04 00:26:43 → 
  Size: 1553
  Editor: wakko
  Comment:
+   ← Revision 93 as of 2004-02-26 16:39:32 → ⇥
  Size: 2299
  Editor: yakko
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 1:
+   * AddressingModes
   * AmdahlsLaw
-Line 4:
+Line 6:
+   * AverageNormalizedExecutionTime
   * ["Bijection"]
   * BooleanAlgebra
-Line 5:
+Line 10:
+   * BoothsAlgorithm
-Line 7:
+Line 13:
+   * CpuTime
   * CyclesPerInstruction (CPI)
   * DataPath
-Line 10:
+Line 19:
+   * DelayBandwidthProduct
-Line 12:
+Line 22:
+   * ExecutionTime
-Line 14:
+Line 25:
+   * FiveClassicPartsOfaComputer
-Line 15:
+Line 27:
+   * FloatingPointRepresentation (IEEE 754)
-Line 16:
+Line 29:
+   * FrameBuffer
   * FreeBooleanAlgebra
   * GeometricMean
-Line 18:
+Line 34:
+   * HammingCode
   * HardwareDesignPrinciples
-Line 24:
+Line 42:
+   * InstructionSetArchitecture (ISA)
-Line 26:
+Line 45:
+   * ["Latency"]
-Line 27:
+Line 47:
+   * LinkerSteps
-Line 31:
+Line 52:
-   * MultiProtocolLabelSwitching (MPLS)
-Line 33:
+Line 53:
+   * ObjectFile
-Line 35:
+Line 56:
+   * ["Performance"]
   * PipeLine
-Line 38:
+Line 61:
+   * ["Processor"] or CPU
   * QueuingTheory
-Line 39:
+Line 64:
+   * ["Register"] (MIPS register)
-Line 40:
+Line 66:
+   * ResponseTime
-Line 48:
+Line 75:
+   * SpatialExtent
   * SpeedUp
-Line 49:
+Line 78:
+   * TcpFastRetransmit
   * TcpFastRecovery
   * ThroughPut
-Line 54:
+Line 86:
+   * WallClockTime