Diff for "ComputerTerms"

Differences between revisions 51 and 90 (spanning 39 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)
["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

-  ⇤ ← Revision 51 as of 2003-10-29 19:16:12 → 
  Size: 1333
  Editor: yakko
  Comment:
+   ← Revision 90 as of 2004-02-19 23:00:39 → ⇥
  Size: 2224
  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)
   * ["Decidable"] and SemiDecidable
-Line 8:
+Line 18:
+   * DelayBandwidthProduct
-Line 10:
+Line 21:
+   * ExecutionTime
-Line 12:
+Line 24:
+   * FiveClassicPartsOfaComputer
   * FixedPoint
-Line 13:
+Line 27:
+   * FrameBuffer
   * FreeBooleanAlgebra
   * GeometricMean
-Line 14:
+Line 31:
+   * GroundBooleanTerm
   * HammingCode
   * HardwareDesignPrinciples
-Line 20:
+Line 40:
+   * InstructionSetArchitecture (ISA)
-Line 22:
+Line 43:
+   * ["Latency"]
-Line 23:
+Line 45:
+   * LinkerSteps
-Line 27:
+Line 50:
-   * MultiProtocolLabelSwitching (MPLS)
+   * MonotoneBooleanTerm
   * ObjectFile
-Line 30:
+Line 54:
+   * ["Performance"]
-Line 33:
+Line 58:
+   * ["Processor"] or CPU
   * QueuingTheory
   * RecursivelyEnumerableSets
   * ["Register"] (MIPS register)
   * RelationallyComplete
   * ResponseTime
-Line 38:
+Line 69:
+   * SemiDecidable and ["Decidable"]
-Line 40:
+Line 72:
+   * SpatialExtent
   * SpeedUp
-Line 41:
+Line 75:
+   * TcpFastRetransmit
   * TcpFastRecovery
   * ThroughPut
-Line 46:
+Line 83:
+   * WallClockTime