• Corpus ID: 244715041

On formally undecidable propositions in nondeterministic languages

@inproceedings{Kolavr2021OnFU,
  title={On formally undecidable propositions in nondeterministic languages},
  author={Martin Kol'avr},
  year={2021}
}

• Martin Kol'avr
• Published 25 November 2021
• Computer Science, Linguistics, Philosophy

Any class of languages L accepted in time T has a counterpart NL accepted in nondeterministic time NT. It follows from the definition of nondeterministic languages that L ⊆ NL. This work shows that every sufficiently powerful language in L 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.