AuDaLa is Turing complete via a verified Turing machine implementation, with proposed extensions for better practical expressivity in parallel settings.
[DD02] J´ er´ emie Detrey and Oliver Diessel.A Constructive Proof of the Turing Completeness of Circal
1 Pith paper cite this work, alongside 8 external citations. Polarity classification is still indexing.
1
Pith paper citing it
8
external citations · OpenAlex
fields
cs.LO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Expressivity of AuDaLa: Turing Completeness and Possible Extensions
AuDaLa is Turing complete via a verified Turing machine implementation, with proposed extensions for better practical expressivity in parallel settings.