|
|
|
|
|
|
by IshKebab
692 days ago
|
|
|
I haven't got to the end of it but I assume this was motivated by some configuration languages using "not Turing complete" as a feature, when the feature they really want to advertise is "reasonably bounded execution time". It came up recently in this discussion about CEL: https://news.ycombinator.com/item?id=40954652 |
|
|