Computational Law

Exercise 2.8 - Counting Functions

Consider a world with n symbols, no constructors, and a single binary predicate; and suppose that the binary relation is functional, i.e. every symbol in the first position is paired with exactly one symbol in the second position. How many distinct datasets satisfy this restriction?

n     n2     2n     nn     2n2     22n