1873
Comment:
|
3012
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AddressingModes * AmdahlsLaw |
|
Line 8: | Line 10: |
* BoothsAlgorithm * CaChe * CacheBlock * CacheCoherenceProtocols * CacheLine |
|
Line 11: | Line 18: |
* CriticalSection * ["Cryptography"] * CyclesPerInstruction (CPI) * DataPath |
|
Line 12: | Line 23: |
* DelayBandwidthProduct * DelayedBranch |
|
Line 14: | Line 27: |
* DelayBandwidthProduct | |
Line 17: | Line 29: |
* DynamicSetOperations | |
Line 18: | Line 31: |
* ExpectedValue * FileSystem (Free BSD) |
|
Line 20: | Line 35: |
* FirstOrderTheory * FiveClassicPartsOfaComputer |
|
Line 21: | Line 38: |
* FloatingPointRepresentation (IEEE 754) | |
Line 22: | Line 40: |
* FrameBuffer | |
Line 23: | Line 42: |
* GeometricMean * GraphTheoryPage |
|
Line 25: | Line 46: |
* HammingCode * HardwareDesignPrinciples |
|
Line 26: | Line 49: |
* InformationRetrieval | |
Line 31: | Line 55: |
* LogicalImplication (|= symbol and also |-) | * InstructionSetArchitecture (ISA) * InvertedFile * LogicalImplication ([[latex2($$\models$$)]] and [[latex2($$\vdash$$)]]) * LogicalMemory (START EDITING HERE) |
Line 34: | Line 61: |
* LeastFixedPoint | |
Line 35: | Line 63: |
* LinkerSteps | |
Line 37: | Line 66: |
* MemoryHierarchy * MemoryStallClockCycles |
|
Line 40: | Line 71: |
* ObjectFile | |
Line 42: | Line 74: |
* PageTable | |
Line 43: | Line 76: |
* PipeLine * PostingsFile |
|
Line 44: | Line 79: |
* PresburgerArithmetic | |
Line 46: | Line 82: |
* ["Processor"] or CPU | |
Line 47: | Line 84: |
* RaceCondition | |
Line 48: | Line 86: |
* ["Register"] (MIPS register) | |
Line 55: | Line 94: |
* SemiAlgebraicSets | |
Line 56: | Line 96: |
* SemiLinearSets | |
Line 60: | Line 101: |
* ["Steganography"] * SuperScalar |
|
Line 61: | Line 104: |
* ["taxonomy"] | |
Line 65: | Line 109: |
* ["taxonomy"] | * TreeStructures |
Line 68: | Line 112: |
* UninterpretedFunctions | |
Line 69: | Line 114: |
* 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)
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"]
- ["Undecidable"]
- ["Valid"] Logic Formula