This essay describes operations on finite sets that mimic the operations of adding, multiplying, and exponentiating counting numbers and uses these operations to explain why discrete mathematicians and computer scientists take 0^0 to equal the number of functions from the empty set to itself, which is 1.