Universal Languages and the Power of Diagonalization

    IEEE Conference on Computational Complexity, pp. 337-346, 2003.

    Cited by: 4|Bibtex|Views4|Links
    EI WOS
    Keywords:
    computabilitycomputational complexityformal languagesset theorycomputable languageMore(8+)

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments