Universal Languages and the Power of Diagonalization
IEEE Conference on Computational Complexity, pp. 337-346, 2003.
computabilitycomputational complexityformal languagesset theorycomputable languageMore(8+)
We define and study strong diagonalization and compare it to weak diagonalization, implicit in (7). Kozen's result in (7) shows that virtually every separation can be recast as weak diagonalization. We show that there are classes of languages which can not be separated by strong diago- nalization and provide evidence that strong diagonali...More
PPT (Upload PPT)