Skip to Main Content
Idaho State University

Glossary

Filter:
# A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
A
A1
AC
ACD
ACK
ACL
ACU
A-D
Ada
ADC
ADH
ADM
ADP
AE
AES
AFJ
AFR
AI
AIG
AIN
AIS
AJ
AK
AKM
ALC
ALE
ALU
AMA
AMI
AMS
ANI
AOS
AP
APC
APD
APL
App
APU
AR
Arg
ARQ
ARS
ASU
AV
AVP
B
B
B1
B2
B3
BBS
BCC
BCD
BCI
Bd
BER
Bit
BIU
BPI
BPS
BR
BSA
BSE
Bug
Bus
BW
C
C*
C1
C2
C3
C3I
C4
CA
Can
Cat
CBA
CBC
CCB
CCI
CCO
CDR
CDS
CF
CFD
CFE
CI
CIA
CIK
CIP
CK
CKG
CKL
CM
CMP
CMS
CN
CNK
COR
CPC
Cpi
CPS
CPU
CRB
CRC
CRO
CRP
CSA
CSC
CSE
CSM
CSO
CSS
CTY
CUP
CVA
CWC
D
D&V
D-A
DAA
DAC
DAU
DC
DCA
DCP
DCS
Dd
DDD
DDN
DDS
DDT
DEC
DED
DES
DF
DIB
DID
Die
DIP
DLE
DMA
DO
Doc
DOD
DOE
DON
DOS
DP
DPB
DPL
DS
DSN
DSU
DTD
DTE
DTS
DUA
E
EAM
EAP
ECM
EDM
EEI
EFD
EFT
EIF
EMS
ENQ
EOF
EOL
EOT
EOU
EPL
Era
ES
ESS
ETB
ETL
ETX
EV
Exa
EXE
F
Fan
FAQ
FAX
FCA
FDM
FEC
FER
FIN
Fix
FOI
FQR
FQT
FRD
Fry
FSD
FTS
H
H
Hat
HCF
HD
HDM
Hex
HF
HLL
Hog
HOL
Hop
HSM
HUS
Hz
I
I&A
I/O
IAC
Ice
ICU
IDN
IDS
IFF
II
IIS
IKE
ILS
IM
IMP
IN
Inc
INF
IOC
IP
IPC
IPM
IRC
IRK
IRM
IS
ISM
ISO
ISS
IT
ITF
ITM
ITS
L
LAN
LDB
LER
LKG
LLC
LMD
LME
LMI
Log
LOS
LP
LPC
LPD
LPI
LPT
Ls
LSI
M
M
MAC
MAN
MD5
MDC
Meg
MEP
MER
Mgt
MHS
MHz
MI
MIB
MLS
MOA
Mod
MOE
MOP
MOU
MRK
MRT
MSE
MTR
MTT
Mu
MUD
MUX
Mw
N
N
NAK
NAR
NBH
NCA
NCC
NCS
NEC
Net
NID
NII
NIL
NIU
NM
NP
NRZ
NSA
NSD
NSI
NSM
NSO
NSP
NTI
NTM
NTN
NXX
O
O&M
Ob
OCR
OEM
OMB
ONA
OPI
OPM
OPT
OR
ORD
OS
OSI
OSU
OTP
OTT
P
P&D
P3P
PA
PAA
PAD
PAE
PAL
PAP
PAX
PBD
PBX
PC
PCA
PCS
PCZ
PD
Pdl
PDN
PDR
PDS
PDU
PES
PIP
PIX
PKA
PKC
PL
PLA
PM
PMD
PMO
PMP
Pod
POM
Pop
PPL
PPN
PPS
Ps
PSL
PSN
PTR
PTT
PUC
PUT
PVC
PWA
PX
R
R&D
RAC
RAM
RAT
RC4
RD
RED
REL
RF
RFC
RFE
RFP
RKV
RL
RMR
RO
ROM
RPM
RQT
RSA
Rsh
RSN
RTI
RTM
RTS
Run
RWX
S
S
S&T
SAO
SAP
SAV
Say
SCG
SCI
SCP
SDR
Set
S-F
SFA
SI
SIG
SMM
SMO
SMU
SO
SOH
SON
SOS
SOW
SPK
Spl
SPO
SPS
Spy
SRI
SRP
SRR
SSE
SSO
SSR
STD
STI
STS
STU
STX
SUB
SYN
T
T&E
TA
TAG
Tap
Tar
TCB
TCD
TCS
TCU
TD
TDM
TED
Tee
TEI
TEK
TEP
TFM
TFS
TLA
TLS
TMC
TNI
Toy
TPC
TPI
TRB
TRR
TSK
Tty
TV
TWX
U
U
UA
UBD
UIS
UK
Up
UPP
URL
UV
W
WAN
Win
WPA
HAKMEM
  • MIT AI Memo 239 (February 1972). A legendary collection of neat mathematical and programming hacks contributed by many people at MIT and elsewhere. (The title of the memo really is "HAKMEM", which is a 6-letterism for `hacks memo'. ) Some of them are very useful techniques, powerful theorems, or interesting unsolved problems, but most fall into the category of mathematical and computer trivia. Here is a sampling of the entries (with authors), slightly paraphrased Item 41 (Gene Salamin) There are exactly 23,000 prime numbers less than 2^18. Item 46 (Rich Schroeppel) The most *probable* suit distribution in bridge hands is 4-4-3-2, as compared to 4-3-3-3, which is the most *evenly* distributed. This is because the world likes to have unequal numbers a thermodynamic effect saying things will not be in the state of lowest energy, but in the state of lowest disordered energy. Item 81 (Rich Schroeppel) Count the magic squares of order 5 (that is, all the 5-by-5 arrangements of the numbers from 1 to 25 such that all rows, columns, and diagonals add up to the same number). There are about 320 million, not counting those that differ only by rotation and reflection. Item 154 (Bill Gosper) The myth that any given programming language is machine independent is easily exploded by computing the sum of powers of 2. If the result loops with period = 1 with sign +, you are on a sign-magnitude machine. If the result loops with period = 1 at -1, you are on a twos-complement machine. If the result loops with period greater than 1, including the beginning, you are on a ones-complement machine. If the result loops with period greater than 1, not including the beginning, your machine isn't binary -- the pattern should tell you the base. If you run out of memory, you are on a string or bignum system. If arithmetic overflow is a fatal error, some fascist pig with a read-only mind is trying to enforce machine independence. But the very ability to trap overflow is machine dependent. By this