We show that unlike the general case of the relationship between algorithmic probability and program-size for enumerating sets, in the case of the graphs of total functions these two quantities are closely related.
