Turing machines with one-sided advice and the acceptance of the co-RE languages
Files
Publication date
2014-02
Authors
van Leeuwen, J.
Wiedermann, Jiří
Editors
Advisors
Supervisors
DOI
Document Type
Report
Metadata
Show full item recordCollections
License
Abstract
We resolve an old problem, namely to design a ‘natural’ machine model for accepting the complements of recursively enumerable languages.
Keywords
Citation
van Leeuwen, J & Wiedermann, J 2014, Turing machines with one-sided advice and the acceptance of the co-RE languages. Technical Report Series, no. UU-CS-2014-003, vol. UU-CS-2014-003, UU BETA ICS Departement Informatica, Utrecht.