Počet záznamů: 1  

On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity

  1. 1.
    SYSNO ASEP0393220
    Druh ASEPJ - Článek v odborném periodiku
    Zařazení RIVJ - Článek v odborném periodiku
    Poddruh JČlánek ve WOS
    NázevOn Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity
    Tvůrce(i) Šíma, Jiří (UIVT-O) RID, SAI, ORCID
    Žák, Stanislav (UIVT-O) SAI, RID
    Zdroj.dok.Fundamenta Informaticae. - : IOS Press - ISSN 0169-2968
    Roč. 152, č. 4 (2017), s. 397-409
    Poč.str.13 s.
    Jazyk dok.eng - angličtina
    Země vyd.NL - Nizozemsko
    Klíč. slovaTuring machine ; hierarchy ; buffer complexity ; diagonalization
    Vědní obor RIVIN - Informatika
    Obor OECDComputer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    CEPGBP202/12/G061 GA ČR - Grantová agentura ČR
    GAP202/10/1333 GA ČR - Grantová agentura ČR
    Institucionální podporaUIVT-O - RVO:67985807
    UT WOS000401338000004
    EID SCOPUS85019447188
    DOI10.3233/FI-2017-1526
    AnotaceWe formulate a very general tight diagonalization method for the Blum complexity measures satisfying two additional axioms related to our diagonalizer machine. We apply this method to two new, mutually related, distance and buffer complexities of Turing machine computations which are important nontrivial examples of natural Blum complexity measures different from time and space. In particular, these measures capture how many times the worktape head needs to move a certain distance during the computation which corresponds to the number of necessary block uploads into a buffer cache memory. We start this study by proving a tight separation which shows that a very small increase in the distance or buffer complexity bound (roughly from f(n) to f(n + 1)) brings provably more computational power to both deterministic and nondeterministic Turing machines even for unary languages. We also obtain hierarchies of the distance and buffer complexity classes.
    PracovištěÚstav informatiky
    KontaktTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Rok sběru2018
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.