Formally, this means that if we encode the databases by integers, then every partial recursive function would be expressible. The encoding, though, is not trivial, since the databases are unordered sets of information, and moreover, contain abstract objects which can be distinguished from each other only by relations in which the objects participate.

[Back to Chapter 11]