In contrast to their reliable and lossy-error counterparts whose termination problems are either undecidable or non-primitive recursive, the termination problem for counter machines with incrementing errors is shown to be ExpSpace-complete. It is also shown that the structural termination problem—deciding whether every run terminates from any starting configuration—for counter machines with incrementing errors is similarly ExpSpace-complete. This stands in marked contrast to both reliable and lossy counter machines, for which the problem is undecidable. The ExpSpace-hardness proof contained herein requires an unbounded supply of counters. Indeed, by fixing the number of available counters, optimal NLogSpace-complete bounds for both the termination and structural termination problems are obtained.

与终止问题无法确定或非本原递归的可靠且有错误错误的对象相比，具有递增错误的计数器计算机的终止问题显示为ExpSpace -complete。还显示出，具有递增错误的计数器机器的结构终止问题（决定每次运行是否从任何启动配置中终止）类似地是ExpSpace -complete。这与可靠的和有损的计数器机器形成鲜明对比，后者的问题尚无法确定。本文包含的ExpSpace硬度证明需要无限制的计数器供应。实际上，通过固定可用计数器的数量，可以优化获得NLogSpace的终止和结构终止问题的完全界限。