載入...
Clockability for Ordinal Turing Machines
We study clockability for Ordinal Turing Machines (OTMs). In particular, we show that, in contrast to the situation for ITTMs, admissible ordinals can be OTM-clockable, that [Formula: see text]-admissible ordinals are never OTM-clockable and that gaps in the OTM-clockable ordinals are always started...
Na minha lista:
| 發表在: | Beyond the Horizon of Computability |
|---|---|
| 主要作者: | |
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
2020
|
| 主題: | |
| 在線閱讀: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7309483/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51466-2_2 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|