Achilles A. Beros
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Achilles A. Beros has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Konstantinos A. Beros
Miami University, Oxford, USA
2 shared publications - Bjørn Kjos-Hanssen
University of Hawai‘i at Manoa
1 shared publication - Colin de la Higuera
University of Nantes
1 shared publication Daniel Flores
Department of Mathematics, University of Hawaii at Manoa, Honolulu, USA
1 shared publicationDavid J. Webb
Department of Mathematics, University of Hawaii at Manoa, Honolulu, USA
1 shared publication- Monique Chyba
University of Hawai‘i at Manoa
1 shared publication
Latest Publications
- 26 August 2020
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 60 (3-4) , 301-315
Learning theory in the arithmetic hierarchy II
- 26 August 2020
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 60 (3-4) , 301-315
Learning theory in the arithmetic hierarchy II
- Open Access
- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Networks and Heterogeneous Media
- Vol. 14 (1) , 1-22
Controlled cellular automata
Cellular Automata have been successfully used to model evolution of complex systems based on simples rules. In this paper we introduce controlled cellular automata to depict the dynamics of systems with controls that can affect their evolution. Using theory from discrete control systems, we derive results for the control of cellular automata in specific cases. The paper is mostly oriented toward two applications: fire spreading; morphogenesis and tumor growth. In both cases, we illustrate the impact of a control on the evolution of the system. For the fire, the control is assumed to be either firelines or firebreaks to prevent spreading or dumping of water, fire retardant and chemicals (foam) on the fire to neutralize it. In the case of cellular growth, the control describes mechanisms used to regulate growth factors and morphogenic events based on the existence of extracellular matrix structures called fractones. The hypothesis is that fractone distribution may coordinate the timing and location of neural cell proliferation, thereby guiding morphogenesis, at several stages of early brain development.
- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Networks and Heterogeneous Media
- Vol. 14 (1) , 1-22
Open AccessControlled cellular automata
Cellular Automata have been successfully used to model evolution of complex systems based on simples rules. In this paper we introduce controlled cellular automata to depict the dynamics of systems with controls that can affect their evolution. Using theory from discrete control systems, we derive results for the control of cellular automata in specific cases. The paper is mostly oriented toward two applications: fire spreading; morphogenesis and tumor growth. In both cases, we illustrate the impact of a control on the evolution of the system. For the fire, the control is assumed to be either firelines or firebreaks to prevent spreading or dumping of water, fire retardant and chemicals (foam) on the fire to neutralize it. In the case of cellular growth, the control describes mechanisms used to regulate growth factors and morphogenic events based on the existence of extracellular matrix structures called fractones. The hypothesis is that fractone distribution may coordinate the timing and location of neural cell proliferation, thereby guiding morphogenesis, at several stages of early brain development.
- Open Access
Effective bi-immunity and randomness
We study the relationship between randomness and effective bi-immunity. Greenberg and Miller have shown that for any oracle X, there are arbitrarily slow-growing DNR functions relative to X that compute no ML random set. We show that the same holds when ML randomness is replaced with effective bi-immunity. It follows that there are sequences of effective Hausdorff dimension 1 that compute no effectively bi-immune set. We also establish an important difference between the two properties. The class Low(MLR, EBI) of oracles relative to which every ML random is effectively bi-immune contains the jump-traceable sets, and is therefore of cardinality continuum.
Open AccessEffective bi-immunity and randomness
We study the relationship between randomness and effective bi-immunity. Greenberg and Miller have shown that for any oracle X, there are arbitrarily slow-growing DNR functions relative to X that compute no ML random set. We show that the same holds when ML randomness is replaced with effective bi-immunity. It follows that there are sequences of effective Hausdorff dimension 1 that compute no effectively bi-immune set. We also establish an important difference between the two properties. The class Low(MLR, EBI) of oracles relative to which every ML random is effectively bi-immune contains the jump-traceable sets, and is therefore of cardinality continuum.
- Open Access
Canonical immunity and genericity
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-Hanssen, is associated instead with Mathias genericity. Specifically, every Mathias generic is canonically immune and no Cohen 2-generic computes a canonically immune set.
Open AccessCanonical immunity and genericity
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-Hanssen, is associated instead with Mathias genericity. Specifically, every Mathias generic is canonically immune and no Cohen 2-generic computes a canonically immune set.
- Open Access
Classifying the Arithmetical Complexity of Teaching Models
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly r.e. families with finite teaching dimension, and (2) the class of uniformly r.e. families with finite positive recursive teaching dimension witnessed by a uniformly r.e. teaching sequence. We also derive the arithmetical complexity of several other decision problems in teaching, such as the problem of deciding, given an effective coding $\{\mathcal L_0,\mathcal L_1,\mathcal L_2,\ldots\}$ of all uniformly r.e. families, any $e$ such that $\mathcal L_e = \{L^e_0,L^e_1,\ldots,\}$, any $i$ and $d$, whether or not the teaching dimension of $L^e_i$ with respect to $\mathcal L_e$ is upper bounded by $d$.Open AccessClassifying the Arithmetical Complexity of Teaching Models
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly r.e. families with finite teaching dimension, and (2) the class of uniformly r.e. families with finite positive recursive teaching dimension witnessed by a uniformly r.e. teaching sequence. We also derive the arithmetical complexity of several other decision problems in teaching, such as the problem of deciding, given an effective coding $\{\mathcal L_0,\mathcal L_1,\mathcal L_2,\ldots\}$ of all uniformly r.e. families, any $e$ such that $\mathcal L_e = \{L^e_0,L^e_1,\ldots,\}$, any $i$ and $d$, whether or not the teaching dimension of $L^e_i$ with respect to $\mathcal L_e$ is upper bounded by $d$. - 30 September 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 146 (4) , 431-459
A Canonical Semi-Deterministic Transducer
We prove the existence of a canonical form for semi-deterministic transducers with sets of pairwise incomparable output strings. Based on this, we develop an algorithm which learns semi-deterministic transducers given access to translation queries. W
- 30 September 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 146 (4) , 431-459
A Canonical Semi-Deterministic Transducer
We prove the existence of a canonical form for semi-deterministic transducers with sets of pairwise incomparable output strings. Based on this, we develop an algorithm which learns semi-deterministic transducers given access to translation queries. W