A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and
no c.e. degree strictly above it is contiguous. We show that there are infinitely many maximal contiguous
degrees. Since the contiguous degrees are definable, the class of maximal contiguous degrees provides the
first example of a definable infinite anti-chain in the c.e. degrees. In addition, we show that the class of
maximal contiguous degrees forms an automorphism base for the c.e. degrees and therefore for the Turing
degrees in general. Finally we note that the construction of a maximal contiguous degree can be modified
to answer a question of Walk about the array computable degrees and a question of Li about isolated
formulas