1 citations · 1 across the 1 of their papers we have counts for
5 papers
From eventually different functions to pandemic numberings
Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen +1
A function is strongly non-recursive (SNR) if it is eventually different from each recursive function. We obtain hierarchy results for the mass problems associated with computing s…
Planar digraphs for automatic complexity
Achilles A. Beros, Bjørn Kjos-Hanssen, Daylan Kaui Yogi
We show that the digraph of a nondeterministic finite automaton witnessing the automatic complexity of a word can always be taken to be planar. In the case of total transition func…
Canonical immunity and genericity
Achilles A. Beros, Konstantinos A. Beros
Whereas the usual notions of immunity -- e.g., immunity, hyperimmunity, etc. -- are associated with Cohen genericity, canonical immunity, as introduced by Beros, Khan and Kjos-Hans…
Learning Theory in the Arithmetic Hierarchy
Achilles Beros
We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of th…
Anomalous Vacillatory Learning
Achilles Beros
In 1986, Osherson, Stob and Weinstein asked whether two variants of anomalous vacillatory learning, TxtFex^*_* and TxtFext^*_*, could be distinguished. In both, a machine is permit…