Undecidable problems not Turing-complete?
Yes, there are intermediate degrees.  One way to see this is that there are computably enumerable sets that are Turing incomparable.  See https://secure.wikimedia.org/wikipedia/en/wiki/Turing_degree for some basic information.