2531
Comment:
|
3071
|
Deletions are marked like this. | Additions are marked like this. |
Line 13: | Line 13: |
* CacheCoherenceProtocols | |
Line 18: | Line 19: |
* ["Cryptography"] * CutFreeProof |
|
Line 27: | Line 30: |
* DynamicSetOperations | |
Line 28: | Line 32: |
* ExpectedValue * FileSystem (Free BSD) |
|
Line 30: | Line 36: |
* FirstOrderTheory | |
Line 37: | Line 44: |
* GraphTheoryPage | |
Line 42: | Line 50: |
* InformationRetrieval | |
Line 48: | Line 57: |
* LogicalImplication (|= symbol and also |-) * LogicalMemory |
* InterfaceMessagingProcessor (IMP) * InvertedFile * LogicalImplication ([[latex2($$\models$$)]] and [[latex2($$\vdash$$)]]) * LogicalMemory (START EDITING HERE) |
Line 52: | Line 63: |
* LeastFixedPoint | |
Line 67: | Line 79: |
* PostingsFile | |
Line 68: | Line 81: |
* PresburgerArithmetic | |
Line 82: | Line 96: |
* SemiAlgebraicSets | |
Line 83: | Line 98: |
* SemiLinearSets | |
Line 87: | Line 103: |
* ["Steganography"] | |
Line 89: | Line 106: |
* ["taxonomy"] | |
Line 93: | Line 111: |
* ["taxonomy"] | * TreeStructures |
Line 96: | Line 114: |
* UninterpretedFunctions |
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