5 research outputs found

    Master Index to Volumes 51–60

    Get PDF

    P-Selectivity, Immunity, and the Power of One Bit

    Full text link
    We prove that P-sel, the class of all P-selective sets, is EXP-immune, but is not EXP/1-immune. That is, we prove that some infinite P-selective set has no infinite EXP-time subset, but we also prove that every infinite P-selective set has some infinite subset in EXP/1. Informally put, the immunity of P-sel is so fragile that it is pierced by a single bit of information. The above claims follow from broader results that we obtain about the immunity of the P-selective sets. In particular, we prove that for every recursive function f, P-sel is DTIME(f)-immune. Yet we also prove that P-sel is not \Pi_2^p/1-immune

    Computability Theory

    Get PDF
    Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong connections with other areas of mathematical logic as well as algebra and theoretical computer science

    Weakly semirecursive sets and R.E. orderings

    No full text
    SIGLETIB: RA 2045(1990,34) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
    corecore