On formally undecidable propositions in nondeterministic languages
share
Any class of languages 𝐋 accepted in time 𝐓 has a counterpart 𝐍𝐋 accepted in nondeterministic time 𝐍𝐓. It follows from the definition of nondeterministic languages that 𝐋⊆𝐍𝐋. This work shows that every sufficiently powerful language in 𝐋 contains a string corresponding to Gödel's undecidable proposition, but this string is not contained in its nondeterministic counterpart. This inconsistency in the definition of nondeterministic languages shows that certain questions regarding nondeterministic time complexity equivalences are irrevocably ill-posed.
READ FULL TEXT
