Abstract
In the late nineteen sixties it was observed that the recursively enumerable languages form an infinite proper hierarchy bassed on the size of the Turing machines that accept them. We examine the fundamental position of the finite languages and their complements in the hierarchy. Several results are shown that how
... read more