Diff for "ComputerTerms"

Differences between revisions 55 and 92 (spanning 37 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"]
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 55 as of 2003-11-02 22:07:01 → 
  Size: 1485
  Editor: yakko
  Comment:
+   ← Revision 92 as of 2004-02-26 16:38:56 → ⇥
  Size: 2284
  Editor: yakko
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 1:
+   * AddressingModes
   * AmdahlsLaw
-Line 4:
+Line 6:
+   * AverageNormalizedExecutionTime
   * ["Bijection"]
   * BooleanAlgebra
   * BooleanTerm
   * BoothsAlgorithm
-Line 6:
+Line 13:
+   * CpuTime
   * CyclesPerInstruction (CPI)
   * DataPath
-Line 9:
+Line 19:
+   * DelayBandwidthProduct
-Line 11:
+Line 22:
+   * ExecutionTime
-Line 13:
+Line 25:
+   * FiveClassicPartsOfaComputer
-Line 14:
+Line 27:
+   * FloatingPointRepresentation (IEEE 754)
-Line 15:
+Line 29:
+   * FrameBuffer
   * FreeBooleanAlgebra
   * GeometricMean
-Line 16:
+Line 33:
+   * GroundBooleanTerm
   * HammingCode
   * HardwareDesignPrinciples
-Line 22:
+Line 42:
+   * InstructionSetArchitecture (ISA)
-Line 24:
+Line 45:
+   * ["Latency"]
-Line 25:
+Line 47:
+   * LinkerSteps
-Line 29:
+Line 52:
-   * MultiProtocolLabelSwitching (MPLS)
+   * MonotoneBooleanTerm
   * ObjectFile
-Line 32:
+Line 56:
+   * ["Performance"]
-Line 35:
+Line 60:
+   * ["Processor"] or CPU
   * QueuingTheory
-Line 36:
+Line 63:
+   * ["Register"] (MIPS register)
-Line 37:
+Line 65:
+   * ResponseTime
-Line 45:
+Line 74:
+   * SpatialExtent
   * SpeedUp
-Line 46:
+Line 77:
+   * TcpFastRetransmit
   * TcpFastRecovery
   * ThroughPut
-Line 51:
+Line 85:
+   * WallClockTime