On Fri, 19 Mar 2021 17:33:57 +0000
raid5atemyhomework <raid5atemyhomew...@protonmail.com> wrote:

The Shepherd language for describing actions on Shepherd daemons is a
Turing-complete Guile language.  Turing completeness runs afoul of
the Principle of Least Power.
Erlang is turing complete and yet it is famously excellent at managing
services in a robust way.

Ironically nowadays almost everything is Turing complete: https://www.gwern.net/Turing-complete

Lack of Turing-completeness by design can be a real feature, i.e. bitcoin script is a perfect practical example of it.




Reply via email to