Turing Machines with One-sided Advice and Acceptance of the co-RE Languages

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F17%3A00427248" target="_blank" >RIV/67985807:_____/17:00427248 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.3233/FI-2017-1544" target="_blank" >http://dx.doi.org/10.3233/FI-2017-1544</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3233/FI-2017-1544" target="_blank" >10.3233/FI-2017-1544</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Turing Machines with One-sided Advice and Acceptance of the co-RE Languages

Popis výsledku v původním jazyce

We resolve an old problem, namely to design a ‘natural’ machine model for accepting the complements of recursively enumerable languages. The model we present is based on nondeterministic Turing machines with ‘one-sided’ advice. We prove that these machines precisely accept the co-RE languages, without restriction on the advice functions that are used. We show that for accepting a co-RE language, one-sided advice is as powerful as arbitrary advice, but also that linearly bounded one-sided advice is sufficient. However, ‘long’ sublinear advice can make Turing machines with one-sided advice accept more co-RE languages than ‘short’ sublinear advice. We prove that infinite proper hierarchies of language classes inside co-RE can be devised, using suitable increasing sequences of bounding functions for the allowed advice. The machine model and the results dualize for the family of recursively enumerable languages.

Název v anglickém jazyce

Turing Machines with One-sided Advice and Acceptance of the co-RE Languages

Popis výsledku anglicky

We resolve an old problem, namely to design a ‘natural’ machine model for accepting the complements of recursively enumerable languages. The model we present is based on nondeterministic Turing machines with ‘one-sided’ advice. We prove that these machines precisely accept the co-RE languages, without restriction on the advice functions that are used. We show that for accepting a co-RE language, one-sided advice is as powerful as arbitrary advice, but also that linearly bounded one-sided advice is sufficient. However, ‘long’ sublinear advice can make Turing machines with one-sided advice accept more co-RE languages than ‘short’ sublinear advice. We prove that infinite proper hierarchies of language classes inside co-RE can be devised, using suitable increasing sequences of bounding functions for the allowed advice. The machine model and the results dualize for the family of recursively enumerable languages.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Fundamenta Informaticae

ISSN

0169-2968

e-ISSN

—

Svazek periodika

153

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

20

Strana od-do

347-366

Kód UT WoS článku

000407178200003

EID výsledku v databázi Scopus

2-s2.0-85027179425