Turing machines with one-sided advice and the acceptance of the co-RE languages

Jan van Leeuwen, Jiří Wiedermann

    Research output: Book/ReportReportAcademic

    Abstract

    We resolve an old problem, namely to design a ‘natural’ machine model for accepting the complements of recursively enumerable languages.
    Original languageEnglish
    Place of PublicationUtrecht
    PublisherUU BETA ICS Departement Informatica
    Number of pages17
    VolumeUU-CS-2014-003
    Publication statusPublished - Feb 2014

    Publication series

    NameTechnical Report Series
    PublisherUU Beta ICS Departement Informatica
    No.UU-CS-2014-003
    ISSN (Print)0924-3275

    Fingerprint

    Dive into the research topics of 'Turing machines with one-sided advice and the acceptance of the co-RE languages'. Together they form a unique fingerprint.

    Cite this