1928
Comment:
|
3071
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AddressingModes | |
Line 9: | Line 10: |
* BoothsAlgorithm * CaChe * CacheBlock * CacheCoherenceProtocols * CacheLine |
|
Line 12: | Line 18: |
* CriticalSection * ["Cryptography"] * CutFreeProof * CyclesPerInstruction (CPI) * DataPath |
|
Line 13: | Line 24: |
* DelayBandwidthProduct * DelayedBranch |
|
Line 15: | Line 28: |
* DelayBandwidthProduct | |
Line 18: | Line 30: |
* DynamicSetOperations | |
Line 19: | Line 32: |
* ExpectedValue * FileSystem (Free BSD) |
|
Line 21: | Line 36: |
* FirstOrderTheory * FiveClassicPartsOfaComputer |
|
Line 22: | Line 39: |
* FloatingPointRepresentation (IEEE 754) | |
Line 23: | Line 41: |
* FrameBuffer | |
Line 25: | Line 44: |
* GraphTheoryPage | |
Line 28: | Line 48: |
* HardwareDesignPrinciples | |
Line 29: | Line 50: |
* InformationRetrieval | |
Line 34: | Line 56: |
* LogicalImplication (|= symbol and also |-) | * InstructionSetArchitecture (ISA) * InterfaceMessagingProcessor (IMP) * InvertedFile * LogicalImplication ([[latex2($$\models$$)]] and [[latex2($$\vdash$$)]]) * LogicalMemory (START EDITING HERE) |
Line 37: | Line 63: |
* LeastFixedPoint | |
Line 38: | Line 65: |
* LinkerSteps | |
Line 40: | Line 68: |
* MemoryHierarchy * MemoryStallClockCycles |
|
Line 43: | Line 73: |
* ObjectFile | |
Line 45: | Line 76: |
* PageTable | |
Line 46: | Line 78: |
* PipeLine * PostingsFile |
|
Line 47: | Line 81: |
* PresburgerArithmetic | |
Line 49: | Line 84: |
* ["Processor"] or CPU | |
Line 50: | Line 86: |
* RaceCondition | |
Line 51: | Line 88: |
* ["Register"] (MIPS register) | |
Line 58: | Line 96: |
* SemiAlgebraicSets | |
Line 59: | Line 98: |
* SemiLinearSets | |
Line 63: | Line 103: |
* ["Steganography"] * SuperScalar |
|
Line 64: | Line 106: |
* ["taxonomy"] | |
Line 68: | Line 111: |
* ["taxonomy"] | * TreeStructures |
Line 71: | Line 114: |
* UninterpretedFunctions | |
Line 72: | Line 116: |
* 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