We find an example of a computable admissible set whose level of computability is higher than that of the standard model of Peano arithmetic. As a byproduct, we construct a 1-decidable model of an undecidable submodel complete theory.

中文翻译：

---

具有非标准可计算性的可计算结构

我们找到了一个可计算的可容许集合的例子，其可计算性水平高于Peano算术的标准模型。作为副产品，我们构造了不确定的子模型完全理论的1决定模型。