|
Size: 1852
Comment:
|
Size: 3221
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * AddressingModes * AmdahlsLaw |
|
| Line 4: | Line 6: |
| * AverageNo | * AverageNormalizedExecutionTime |
| Line 8: | Line 10: |
| * BoothsAlgorithm * CaChe * CacheBlock * CacheCoherenceProtocols * CacheLine |
|
| Line 11: | Line 18: |
| * CriticalSection * ["Cryptography"] * CutFreeProof * CyclesPerInstruction (CPI) * DataPath |
|
| Line 12: | Line 24: |
| * DelayBandwidthProduct * DelayedBranch |
|
| Line 14: | Line 28: |
| * DelayBandwidthProduct | |
| Line 17: | Line 30: |
| * DynamicSetOperations | |
| Line 18: | Line 32: |
| * ExpectedValue * FileSystem (Free BSD) |
|
| Line 20: | Line 36: |
| * FirstOrderTheory * FiveClassicPartsOfaComputer |
|
| Line 21: | Line 39: |
| * FloatingPointRepresentation (IEEE 754) | |
| Line 22: | Line 41: |
| * FrameBuffer | |
| Line 23: | Line 43: |
| * GeometricMean * GraphTheoryPage |
|
| Line 25: | Line 47: |
| * HammingCode * HardwareDesignPrinciples |
|
| Line 26: | Line 50: |
| * InformationRetrieval | |
| Line 31: | Line 56: |
| * LogicalImplication (|= symbol and also |-) | * ["Interpolant"] * InstructionSetArchitecture (ISA) * InterfaceMessagingProcessor (IMP) * InvertedFile * LogicalImplication ([[latex2($$\models$$)]] and [[latex2($$\vdash$$)]]) * LogicalMemory (START EDITING HERE) |
| Line 34: | Line 64: |
| * LeastFixedPoint | |
| Line 35: | Line 66: |
| * LinkerSteps | |
| Line 37: | Line 69: |
| * MemoryHierarchy * MemoryStallClockCycles |
|
| Line 40: | Line 74: |
| * ObjectFile | |
| Line 42: | Line 77: |
| * PageTable * PartialOrder |
|
| Line 43: | Line 80: |
| * PipeLine * PoSet (PartiallyOrderedSet) * PostingsFile |
|
| Line 44: | Line 84: |
| * PresburgerArithmetic | |
| Line 46: | Line 87: |
| * ["Processor"] or CPU | |
| Line 47: | Line 89: |
| * RaceCondition | |
| Line 48: | Line 91: |
| * ["Register"] (MIPS register) | |
| Line 55: | Line 99: |
| * SemiAlgebraicSets | |
| Line 56: | Line 101: |
| * SemiDefinite * SemiLinearSets |
|
| Line 60: | Line 107: |
| * ["Steganography"] * SuperScalar |
|
| Line 61: | Line 110: |
| * ["taxonomy"] | |
| Line 65: | Line 115: |
| * ["taxonomy"] | * TreeStructures * TruthFunction (notation for [[latex2($\vdash$)]]) |
| Line 68: | Line 119: |
| * UninterpretedFunctions | |
| Line 69: | Line 121: |
| * VirtualMemory |
AutonomousSystem (AS)
- ["Bijection"]
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
- ["Cryptography"]
CyclesPerInstruction (CPI)
["Decidable"] and SemiDecidable
- ["Dichotomy"]
FileSystem (Free BSD)
FloatingPointRepresentation (IEEE 754)
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
- ["Interpolant"]
LogicalImplication (latex2($$\models$$) and latex2($$\vdash$$))
LogicalMemory (START EDITING HERE)
- ["Latency"]
MaximumTransmissionUnit (MTU)
- ["Model"] of a logic formula
OsiModel (7 layer OSI network Model)
- ["Performance"]
["Proposition"] or PropositionalLogic
- ["Processor"] or CPU
- ["Register"] (MIPS register)
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Steganography"]
- ["Tautology"]
- ["taxonomy"]
TruthFunction (notation for latex2($\vdash$))
- ["Undecidable"]
- ["Valid"] Logic Formula