1 vote

I mean how it is a trivial property, we can write Tyes ( TM having even states) and Tno ( TM having odd states) for it.Can Turing machine can never have odd number of states?

2 votes

We can make every recursively enumerable language to follow this property by doing a little modification which is that we can add a useless state in case of TM with odd no of states due to which they will also have an even number of states. Hence for each of the recursively enumerable languages, we can have TM correspond to them having an even number of states thereby making it a trivial property.